/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 11:43:50,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 11:43:50,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 11:43:50,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 11:43:50,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 11:43:50,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 11:43:50,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 11:43:50,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 11:43:50,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 11:43:50,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 11:43:50,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 11:43:50,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 11:43:50,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 11:43:50,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 11:43:50,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 11:43:50,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 11:43:50,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 11:43:50,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 11:43:50,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 11:43:50,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 11:43:50,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 11:43:50,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 11:43:50,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 11:43:50,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 11:43:50,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 11:43:50,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 11:43:50,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 11:43:50,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 11:43:50,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 11:43:50,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 11:43:50,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 11:43:50,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 11:43:50,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 11:43:50,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 11:43:50,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 11:43:50,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 11:43:50,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 11:43:50,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 11:43:50,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 11:43:50,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 11:43:50,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 11:43:50,674 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-RepeatedSemanticLbe.epf [2021-06-11 11:43:50,706 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 11:43:50,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 11:43:50,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 11:43:50,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 11:43:50,708 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 11:43:50,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 11:43:50,708 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 11:43:50,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 11:43:50,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 11:43:50,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 11:43:50,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 11:43:50,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 11:43:50,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 11:43:50,709 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 11:43:50,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 11:43:50,709 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 11:43:50,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 11:43:50,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 11:43:50,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 11:43:50,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 11:43:50,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 11:43:50,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 11:43:50,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 11:43:50,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 11:43:50,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 11:43:50,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 11:43:50,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 11:43:50,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 11:43:50,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 11:43:50,711 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-06-11 11:43:50,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 11:43:51,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 11:43:51,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 11:43:51,019 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-11 11:43:51,020 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-11 11:43:51,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl [2021-06-11 11:43:51,023 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl' [2021-06-11 11:43:51,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 11:43:51,060 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-11 11:43:51,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 11:43:51,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 11:43:51,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 11:43:51,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/1) ... [2021-06-11 11:43:51,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/1) ... [2021-06-11 11:43:51,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 11:43:51,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 11:43:51,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 11:43:51,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 11:43:51,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/1) ... [2021-06-11 11:43:51,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/1) ... [2021-06-11 11:43:51,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/1) ... [2021-06-11 11:43:51,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/1) ... [2021-06-11 11:43:51,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/1) ... [2021-06-11 11:43:51,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/1) ... [2021-06-11 11:43:51,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/1) ... [2021-06-11 11:43:51,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 11:43:51,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 11:43:51,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 11:43:51,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 11:43:51,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (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-06-11 11:43:51,183 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-11 11:43:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-11 11:43:51,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-11 11:43:51,183 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-11 11:43:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-11 11:43:51,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-11 11:43:51,184 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-11 11:43:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 11:43:51,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 11:43:51,184 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-11 11:43:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-11 11:43:51,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-11 11:43:51,184 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-06-11 11:43:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-06-11 11:43:51,185 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-06-11 11:43:51,185 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-06-11 11:43:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-06-11 11:43:51,185 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-06-11 11:43:51,186 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 11:43:51,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 11:43:51,415 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-11 11:43:51,417 INFO L202 PluginConnector]: Adding new model min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 11:43:51 BoogieIcfgContainer [2021-06-11 11:43:51,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 11:43:51,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 11:43:51,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 11:43:51,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 11:43:51,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 11:43:51" (1/2) ... [2021-06-11 11:43:51,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c01c3e7 and model type min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 11:43:51, skipping insertion in model container [2021-06-11 11:43:51,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 11:43:51" (2/2) ... [2021-06-11 11:43:51,423 INFO L111 eAbstractionObserver]: Analyzing ICFG min-max-inc-dec.wvr.bpl [2021-06-11 11:43:51,427 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 11:43:51,430 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-06-11 11:43:51,430 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 11:43:51,527 INFO L149 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2021-06-11 11:43:51,547 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 11:43:51,579 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 11:43:51,580 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 11:43:51,580 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 11:43:51,580 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 11:43:51,580 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 11:43:51,580 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 11:43:51,580 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 11:43:51,580 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 11:43:51,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 42 transitions, 124 flow [2021-06-11 11:43:51,638 INFO L129 PetriNetUnfolder]: 4/37 cut-off events. [2021-06-11 11:43:51,638 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-06-11 11:43:51,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 37 events. 4/37 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 81 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2021-06-11 11:43:51,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 42 transitions, 124 flow [2021-06-11 11:43:51,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 35 transitions, 100 flow [2021-06-11 11:43:51,646 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:51,663 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 100 flow [2021-06-11 11:43:51,666 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 100 flow [2021-06-11 11:43:51,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 100 flow [2021-06-11 11:43:51,687 INFO L129 PetriNetUnfolder]: 4/35 cut-off events. [2021-06-11 11:43:51,687 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-06-11 11:43:51,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 4/35 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 78 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2021-06-11 11:43:51,690 INFO L151 LiptonReduction]: Number of co-enabled transitions 552 [2021-06-11 11:43:51,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:51,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:51,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:51,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:51,899 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.6 percent of original size [2021-06-11 11:43:51,903 INFO L147 QuantifierPusher]: treesize reduction 10, result has 9.1 percent of original size 1 [2021-06-11 11:43:51,955 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.6 percent of original size [2021-06-11 11:43:51,959 INFO L147 QuantifierPusher]: treesize reduction 10, result has 9.1 percent of original size 1 [2021-06-11 11:43:52,108 INFO L163 LiptonReduction]: Checked pairs total: 348 [2021-06-11 11:43:52,108 INFO L165 LiptonReduction]: Total number of compositions: 10 [2021-06-11 11:43:52,118 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 473 [2021-06-11 11:43:52,140 INFO L129 PetriNetUnfolder]: 4/24 cut-off events. [2021-06-11 11:43:52,140 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-06-11 11:43:52,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:52,141 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] [2021-06-11 11:43:52,142 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:52,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:52,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1547649520, now seen corresponding path program 1 times [2021-06-11 11:43:52,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:52,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104274665] [2021-06-11 11:43:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:52,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-06-11 11:43:52,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:52,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104274665] [2021-06-11 11:43:52,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:43:52,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 11:43:52,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759399254] [2021-06-11 11:43:52,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:43:52,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:52,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:43:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 11:43:52,304 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 52 [2021-06-11 11:43:52,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-06-11 11:43:52,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:52,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 52 [2021-06-11 11:43:52,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:43:52,342 INFO L129 PetriNetUnfolder]: 5/34 cut-off events. [2021-06-11 11:43:52,342 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-11 11:43:52,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 34 events. 5/34 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2021-06-11 11:43:52,344 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 2 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2021-06-11 11:43:52,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 96 flow [2021-06-11 11:43:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 11:43:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 11:43:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2021-06-11 11:43:52,356 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2021-06-11 11:43:52,357 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 232 transitions. [2021-06-11 11:43:52,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 232 transitions. [2021-06-11 11:43:52,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:43:52,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 232 transitions. [2021-06-11 11:43:52,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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-06-11 11:43:52,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:52,372 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:52,373 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 80 flow. Second operand 5 states and 232 transitions. [2021-06-11 11:43:52,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 96 flow [2021-06-11 11:43:52,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 76 flow, removed 0 selfloop flow, removed 10 redundant places. [2021-06-11 11:43:52,380 INFO L241 Difference]: Finished difference. Result has 33 places, 27 transitions, 80 flow [2021-06-11 11:43:52,382 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2021-06-11 11:43:52,382 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2021-06-11 11:43:52,382 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:52,383 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 80 flow [2021-06-11 11:43:52,383 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 80 flow [2021-06-11 11:43:52,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 80 flow [2021-06-11 11:43:52,396 INFO L129 PetriNetUnfolder]: 5/34 cut-off events. [2021-06-11 11:43:52,396 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-06-11 11:43:52,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 34 events. 5/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2021-06-11 11:43:52,398 INFO L151 LiptonReduction]: Number of co-enabled transitions 262 [2021-06-11 11:43:52,411 INFO L163 LiptonReduction]: Checked pairs total: 56 [2021-06-11 11:43:52,411 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:43:52,411 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-06-11 11:43:52,413 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 80 flow [2021-06-11 11:43:52,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-06-11 11:43:52,414 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:52,414 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] [2021-06-11 11:43:52,415 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-11 11:43:52,415 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:52,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:52,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1943799234, now seen corresponding path program 2 times [2021-06-11 11:43:52,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:52,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877449737] [2021-06-11 11:43:52,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:52,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-06-11 11:43:52,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:52,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877449737] [2021-06-11 11:43:52,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:43:52,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 11:43:52,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557097080] [2021-06-11 11:43:52,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:43:52,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:43:52,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 11:43:52,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 52 [2021-06-11 11:43:52,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-06-11 11:43:52,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:52,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 52 [2021-06-11 11:43:52,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:43:52,492 INFO L129 PetriNetUnfolder]: 8/54 cut-off events. [2021-06-11 11:43:52,493 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-11 11:43:52,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 54 events. 8/54 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 0 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 59. Up to 6 conditions per place. [2021-06-11 11:43:52,494 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 3 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2021-06-11 11:43:52,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 107 flow [2021-06-11 11:43:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 11:43:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 11:43:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2021-06-11 11:43:52,496 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2021-06-11 11:43:52,496 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 232 transitions. [2021-06-11 11:43:52,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 232 transitions. [2021-06-11 11:43:52,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:43:52,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 232 transitions. [2021-06-11 11:43:52,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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-06-11 11:43:52,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:52,498 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:52,499 INFO L185 Difference]: Start difference. First operand has 33 places, 27 transitions, 80 flow. Second operand 5 states and 232 transitions. [2021-06-11 11:43:52,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 107 flow [2021-06-11 11:43:52,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 11:43:52,500 INFO L241 Difference]: Finished difference. Result has 38 places, 30 transitions, 110 flow [2021-06-11 11:43:52,500 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2021-06-11 11:43:52,501 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2021-06-11 11:43:52,501 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:52,501 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 110 flow [2021-06-11 11:43:52,501 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 110 flow [2021-06-11 11:43:52,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 110 flow [2021-06-11 11:43:52,510 INFO L129 PetriNetUnfolder]: 8/54 cut-off events. [2021-06-11 11:43:52,510 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-11 11:43:52,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 54 events. 8/54 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2021-06-11 11:43:52,511 INFO L151 LiptonReduction]: Number of co-enabled transitions 298 [2021-06-11 11:43:52,521 INFO L163 LiptonReduction]: Checked pairs total: 60 [2021-06-11 11:43:52,521 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:43:52,521 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-06-11 11:43:52,522 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 110 flow [2021-06-11 11:43:52,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-06-11 11:43:52,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:52,523 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] [2021-06-11 11:43:52,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-11 11:43:52,523 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1128265854, now seen corresponding path program 3 times [2021-06-11 11:43:52,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:52,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433925633] [2021-06-11 11:43:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:52,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:52,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:43:52,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:52,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:52,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433925633] [2021-06-11 11:43:52,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:43:52,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 11:43:52,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63012224] [2021-06-11 11:43:52,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 11:43:52,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:52,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 11:43:52,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 11:43:52,614 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 52 [2021-06-11 11:43:52,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 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-06-11 11:43:52,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:52,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 52 [2021-06-11 11:43:52,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:43:52,709 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][32], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 22#L38true, 8#L51-1true, 72#(and v_assert (not b2)), Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0))]) [2021-06-11 11:43:52,709 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,709 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,709 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,710 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,711 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][31], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 19#thread2ENTRYtrue, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true]) [2021-06-11 11:43:52,711 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,711 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,711 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,711 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,712 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][31], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 19#thread2ENTRYtrue, 4#thread5EXITtrue, 8#L51-1true, 72#(and v_assert (not b2)), Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true]) [2021-06-11 11:43:52,712 INFO L384 tUnfolder$Statistics]: this new event has 9 ancestors and is not cut-off event [2021-06-11 11:43:52,712 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 11:43:52,712 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 11:43:52,712 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 11:43:52,712 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 11:43:52,712 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][32], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 22#L38true, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true]) [2021-06-11 11:43:52,713 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,713 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,713 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,713 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,713 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,721 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 21#L40-1true, 26#thread1ENTRYtrue, 63#(and v_assert (not b1))]) [2021-06-11 11:43:52,721 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,721 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,721 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,721 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,722 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][37], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true]) [2021-06-11 11:43:52,723 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,723 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,723 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,723 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,723 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][32], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 22#L38true, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0))]) [2021-06-11 11:43:52,723 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,724 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,724 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,724 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,724 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,724 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,725 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 46#L25true, 14#L62-1true, 21#L40-1true, 63#(and v_assert (not b1))]) [2021-06-11 11:43:52,725 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,725 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,726 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,726 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,726 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true]) [2021-06-11 11:43:52,726 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,726 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,726 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,726 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,753 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 21#L40-1true, 26#thread1ENTRYtrue, 63#(and v_assert (not b1))]) [2021-06-11 11:43:52,754 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2021-06-11 11:43:52,754 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 11:43:52,757 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 11:43:52,758 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 11:43:52,758 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 11:43:52,758 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 46#L25true, 21#L40-1true, 63#(and v_assert (not b1))]) [2021-06-11 11:43:52,761 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,761 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,761 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,761 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,761 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,764 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true]) [2021-06-11 11:43:52,765 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 11:43:52,765 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,765 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,765 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,765 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,765 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][37], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0))]) [2021-06-11 11:43:52,765 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,766 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,766 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,766 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,766 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,766 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][37], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true]) [2021-06-11 11:43:52,766 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2021-06-11 11:43:52,766 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:52,767 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:52,767 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:52,767 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:52,767 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:52,767 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true]) [2021-06-11 11:43:52,767 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,767 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,767 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,768 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,768 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,768 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:43:52,798 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true]) [2021-06-11 11:43:52,798 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 11:43:52,798 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,798 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,798 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,798 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,798 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:43:52,799 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,814 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][52], [Black: 60#(not b1), 33#thread5ENTRYtrue, Black: 61#v_assert, 67#true, 20#L85true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0))]) [2021-06-11 11:43:52,814 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2021-06-11 11:43:52,814 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:52,814 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:52,814 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:52,825 INFO L129 PetriNetUnfolder]: 299/609 cut-off events. [2021-06-11 11:43:52,825 INFO L130 PetriNetUnfolder]: For 237/279 co-relation queries the response was YES. [2021-06-11 11:43:52,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 609 events. 299/609 cut-off events. For 237/279 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3106 event pairs, 16 based on Foata normal form. 5/595 useless extension candidates. Maximal degree in co-relation 1025. Up to 203 conditions per place. [2021-06-11 11:43:52,830 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 15 selfloop transitions, 11 changer transitions 30/72 dead transitions. [2021-06-11 11:43:52,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 366 flow [2021-06-11 11:43:52,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 11:43:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 11:43:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 370 transitions. [2021-06-11 11:43:52,832 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7905982905982906 [2021-06-11 11:43:52,833 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 370 transitions. [2021-06-11 11:43:52,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 370 transitions. [2021-06-11 11:43:52,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:43:52,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 370 transitions. [2021-06-11 11:43:52,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 41.111111111111114) internal successors, (370), 9 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-06-11 11:43:52,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-06-11 11:43:52,836 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-06-11 11:43:52,836 INFO L185 Difference]: Start difference. First operand has 38 places, 30 transitions, 110 flow. Second operand 9 states and 370 transitions. [2021-06-11 11:43:52,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 366 flow [2021-06-11 11:43:52,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 11:43:52,839 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 184 flow [2021-06-11 11:43:52,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2021-06-11 11:43:52,839 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2021-06-11 11:43:52,839 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:52,840 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 184 flow [2021-06-11 11:43:52,840 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 184 flow [2021-06-11 11:43:52,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 184 flow [2021-06-11 11:43:52,848 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][15], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:52,849 INFO L384 tUnfolder$Statistics]: this new event has 9 ancestors and is not cut-off event [2021-06-11 11:43:52,849 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 11:43:52,849 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 11:43:52,849 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 11:43:52,849 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][15], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:52,850 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,850 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,850 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,850 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,850 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-06-11 11:43:52,851 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:52,851 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,851 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,851 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,851 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,851 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:52,851 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,852 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,852 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,852 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,852 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,853 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:52,853 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,853 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,853 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,853 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,854 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:52,854 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2021-06-11 11:43:52,854 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:52,854 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:52,854 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:52,854 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:52,855 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:52,855 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:52,855 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 11:43:52,855 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:52,855 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:52,855 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:52,855 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:52,856 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:52,856 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 11:43:52,856 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,856 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,856 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,857 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,857 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,857 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][34], [Black: 79#(= min max), 33#thread5ENTRYtrue, Black: 60#(not b1), Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0)), 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:52,857 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2021-06-11 11:43:52,857 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:52,857 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:52,857 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:52,858 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][34], [Black: 79#(= min max), 33#thread5ENTRYtrue, Black: 60#(not b1), Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:52,858 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-06-11 11:43:52,858 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 11:43:52,858 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 11:43:52,858 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:52,860 INFO L129 PetriNetUnfolder]: 98/189 cut-off events. [2021-06-11 11:43:52,860 INFO L130 PetriNetUnfolder]: For 385/394 co-relation queries the response was YES. [2021-06-11 11:43:52,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 189 events. 98/189 cut-off events. For 385/394 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 686 event pairs, 5 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 582. Up to 82 conditions per place. [2021-06-11 11:43:52,864 INFO L151 LiptonReduction]: Number of co-enabled transitions 394 [2021-06-11 11:43:52,869 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:43:52,869 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:43:52,869 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-06-11 11:43:52,870 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 184 flow [2021-06-11 11:43:52,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 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-06-11 11:43:52,870 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:52,870 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] [2021-06-11 11:43:52,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-11 11:43:52,871 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:52,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:52,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1488375128, now seen corresponding path program 4 times [2021-06-11 11:43:52,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:52,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776781669] [2021-06-11 11:43:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:52,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:52,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:43:52,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:52,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:52,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:52,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776781669] [2021-06-11 11:43:52,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:43:52,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 11:43:52,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985284591] [2021-06-11 11:43:52,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 11:43:52,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 11:43:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 11:43:52,905 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 52 [2021-06-11 11:43:52,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 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-06-11 11:43:52,905 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:52,905 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 52 [2021-06-11 11:43:52,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:43:52,988 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:52,988 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,988 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,988 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:52,988 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,991 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:52,991 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,991 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,991 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,991 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,993 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 22#L38true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:52,993 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,993 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,993 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:52,993 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:52,994 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:52,994 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,994 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,994 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,994 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:52,995 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,003 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,003 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2021-06-11 11:43:53,003 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 11:43:53,003 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 11:43:53,003 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 11:43:53,003 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 11:43:53,004 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 22#L38true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:53,004 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 11:43:53,004 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:53,004 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:53,004 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,004 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,005 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,005 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,006 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,006 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,006 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,006 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,006 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,007 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,007 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 11:43:53,007 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,007 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,007 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,007 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,007 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,007 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,008 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:53,008 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,008 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,008 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,008 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,010 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][48], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, Black: 61#v_assert, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,010 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,010 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,010 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,010 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,025 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, 72#(and v_assert (not b2)), Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 22#L38true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,026 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,026 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,026 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,026 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,027 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,027 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 11:43:53,027 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,027 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,027 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,027 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:43:53,027 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,027 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,027 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,028 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][53], [Black: 79#(= min max), 33#thread5ENTRYtrue, 97#true, Black: 60#(not b1), Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0)), 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:53,028 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 11:43:53,028 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:43:53,028 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:43:53,028 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:43:53,028 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:53,028 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,028 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,029 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,029 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,029 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,029 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][48], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, Black: 61#v_assert, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,030 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,030 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,030 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,030 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,030 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,030 INFO L382 tUnfolder$Statistics]: inserting event number 9 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,030 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,030 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,030 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:43:53,030 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,030 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,030 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:43:53,031 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,031 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,031 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,040 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][53], [Black: 79#(= min max), 33#thread5ENTRYtrue, Black: 60#(not b1), 97#true, Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0)), 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 11:43:53,040 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-06-11 11:43:53,040 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:53,040 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 11:43:53,040 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:53,040 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 11:43:53,049 INFO L129 PetriNetUnfolder]: 218/394 cut-off events. [2021-06-11 11:43:53,049 INFO L130 PetriNetUnfolder]: For 1157/1249 co-relation queries the response was YES. [2021-06-11 11:43:53,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 394 events. 218/394 cut-off events. For 1157/1249 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1583 event pairs, 14 based on Foata normal form. 11/395 useless extension candidates. Maximal degree in co-relation 1521. Up to 192 conditions per place. [2021-06-11 11:43:53,054 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 21 selfloop transitions, 15 changer transitions 23/75 dead transitions. [2021-06-11 11:43:53,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 619 flow [2021-06-11 11:43:53,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 11:43:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 11:43:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 370 transitions. [2021-06-11 11:43:53,056 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7905982905982906 [2021-06-11 11:43:53,056 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 370 transitions. [2021-06-11 11:43:53,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 370 transitions. [2021-06-11 11:43:53,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:43:53,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 370 transitions. [2021-06-11 11:43:53,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 41.111111111111114) internal successors, (370), 9 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-06-11 11:43:53,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-06-11 11:43:53,060 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-06-11 11:43:53,060 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 184 flow. Second operand 9 states and 370 transitions. [2021-06-11 11:43:53,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 619 flow [2021-06-11 11:43:53,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 553 flow, removed 32 selfloop flow, removed 6 redundant places. [2021-06-11 11:43:53,068 INFO L241 Difference]: Finished difference. Result has 54 places, 46 transitions, 321 flow [2021-06-11 11:43:53,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=321, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2021-06-11 11:43:53,069 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2021-06-11 11:43:53,069 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:53,069 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 321 flow [2021-06-11 11:43:53,069 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 46 transitions, 321 flow [2021-06-11 11:43:53,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 321 flow [2021-06-11 11:43:53,087 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,087 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,087 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,087 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,087 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,088 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][5], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 19#thread2ENTRYtrue, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,089 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2021-06-11 11:43:53,089 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:53,089 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:53,089 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:53,089 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][5], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 19#thread2ENTRYtrue, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,090 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 11:43:53,090 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 11:43:53,090 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:53,090 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:53,090 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 11:43:53,091 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,091 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,091 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,091 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,091 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,091 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,092 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,092 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,092 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,092 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,092 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,092 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,092 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,095 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,095 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 11:43:53,095 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,096 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,096 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,096 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,096 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,096 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,096 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,097 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,097 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,097 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,097 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,099 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-06-11 11:43:53,100 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,100 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,100 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,100 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 11:43:53,101 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][5], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 22#L38true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,101 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,101 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,101 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,101 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,102 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,102 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 11:43:53,102 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,102 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,102 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,103 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:43:53,103 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,103 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,103 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 11:43:53,103 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,103 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,104 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,104 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,104 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,104 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,105 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-06-11 11:43:53,105 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,105 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,105 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,105 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,105 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 11:43:53,106 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][40], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 33#thread5ENTRYtrue, 8#L51-1true, Black: 69#(not b2), 14#L62-1true, 78#(= max (select A 0)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 20#L85true, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-06-11 11:43:53,106 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 11:43:53,106 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:43:53,106 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:43:53,106 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:43:53,107 INFO L382 tUnfolder$Statistics]: inserting event number 9 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 11:43:53,107 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,107 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,107 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-06-11 11:43:53,107 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,107 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,107 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-06-11 11:43:53,107 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,107 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,107 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 11:43:53,109 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][40], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 33#thread5ENTRYtrue, 8#L51-1true, Black: 69#(not b2), 78#(= max (select A 0)), 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 20#L85true, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-06-11 11:43:53,109 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-06-11 11:43:53,109 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:53,109 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 11:43:53,109 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 11:43:53,109 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 11:43:53,113 INFO L129 PetriNetUnfolder]: 158/299 cut-off events. [2021-06-11 11:43:53,113 INFO L130 PetriNetUnfolder]: For 1050/1107 co-relation queries the response was YES. [2021-06-11 11:43:53,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 299 events. 158/299 cut-off events. For 1050/1107 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1204 event pairs, 6 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 1180. Up to 132 conditions per place. [2021-06-11 11:43:53,120 INFO L151 LiptonReduction]: Number of co-enabled transitions 552 [2021-06-11 11:43:53,125 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:43:53,125 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:43:53,126 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-06-11 11:43:53,127 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 321 flow [2021-06-11 11:43:53,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 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-06-11 11:43:53,127 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:53,127 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] [2021-06-11 11:43:53,128 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-11 11:43:53,128 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:53,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1773407713, now seen corresponding path program 1 times [2021-06-11 11:43:53,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:53,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226965169] [2021-06-11 11:43:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:53,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,206 INFO L142 QuantifierPusher]: treesize reduction 24, result has 59.3 percent of original size [2021-06-11 11:43:53,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 11:43:53,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:43:53,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:53,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226965169] [2021-06-11 11:43:53,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819731835] [2021-06-11 11:43:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:43:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:53,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-11 11:43:53,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:43:53,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:43:53,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:53,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:43:53,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,410 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:43:53,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:53,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:43:53,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:53,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:53,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:53,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:43:53,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 8 [2021-06-11 11:43:53,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157802389] [2021-06-11 11:43:53,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 11:43:53,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:53,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 11:43:53,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-06-11 11:43:53,485 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2021-06-11 11:43:53,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 321 flow. Second operand has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 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-06-11 11:43:53,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:53,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2021-06-11 11:43:53,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:43:54,596 INFO L129 PetriNetUnfolder]: 4318/5895 cut-off events. [2021-06-11 11:43:54,596 INFO L130 PetriNetUnfolder]: For 28927/29143 co-relation queries the response was YES. [2021-06-11 11:43:54,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26512 conditions, 5895 events. 4318/5895 cut-off events. For 28927/29143 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 29947 event pairs, 228 based on Foata normal form. 167/6046 useless extension candidates. Maximal degree in co-relation 26423. Up to 2333 conditions per place. [2021-06-11 11:43:54,653 INFO L132 encePairwiseOnDemand]: 42/52 looper letters, 94 selfloop transitions, 42 changer transitions 170/318 dead transitions. [2021-06-11 11:43:54,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 318 transitions, 2922 flow [2021-06-11 11:43:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-11 11:43:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-06-11 11:43:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 998 transitions. [2021-06-11 11:43:54,657 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6397435897435897 [2021-06-11 11:43:54,657 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 998 transitions. [2021-06-11 11:43:54,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 998 transitions. [2021-06-11 11:43:54,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:43:54,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 998 transitions. [2021-06-11 11:43:54,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 33.266666666666666) internal successors, (998), 30 states have internal predecessors, (998), 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-06-11 11:43:54,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 52.0) internal successors, (1612), 31 states have internal predecessors, (1612), 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-06-11 11:43:54,663 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 52.0) internal successors, (1612), 31 states have internal predecessors, (1612), 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-06-11 11:43:54,663 INFO L185 Difference]: Start difference. First operand has 50 places, 46 transitions, 321 flow. Second operand 30 states and 998 transitions. [2021-06-11 11:43:54,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 318 transitions, 2922 flow [2021-06-11 11:43:54,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 318 transitions, 2584 flow, removed 169 selfloop flow, removed 3 redundant places. [2021-06-11 11:43:54,887 INFO L241 Difference]: Finished difference. Result has 102 places, 68 transitions, 770 flow [2021-06-11 11:43:54,887 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=770, PETRI_PLACES=102, PETRI_TRANSITIONS=68} [2021-06-11 11:43:54,887 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2021-06-11 11:43:54,888 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:54,888 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 68 transitions, 770 flow [2021-06-11 11:43:54,888 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 68 transitions, 770 flow [2021-06-11 11:43:54,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 68 transitions, 770 flow [2021-06-11 11:43:54,968 INFO L129 PetriNetUnfolder]: 336/649 cut-off events. [2021-06-11 11:43:54,968 INFO L130 PetriNetUnfolder]: For 15168/15284 co-relation queries the response was YES. [2021-06-11 11:43:54,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 649 events. 336/649 cut-off events. For 15168/15284 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3316 event pairs, 33 based on Foata normal form. 5/605 useless extension candidates. Maximal degree in co-relation 4356. Up to 317 conditions per place. [2021-06-11 11:43:54,988 INFO L151 LiptonReduction]: Number of co-enabled transitions 824 [2021-06-11 11:43:54,997 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:43:54,997 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:43:54,997 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 109 [2021-06-11 11:43:54,998 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 770 flow [2021-06-11 11:43:54,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 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-06-11 11:43:54,998 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:54,998 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] [2021-06-11 11:43:55,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:43:55,219 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1731414259, now seen corresponding path program 1 times [2021-06-11 11:43:55,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:55,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809520596] [2021-06-11 11:43:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:55,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,311 INFO L142 QuantifierPusher]: treesize reduction 14, result has 56.3 percent of original size [2021-06-11 11:43:55,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 11:43:55,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:55,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:43:55,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:55,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809520596] [2021-06-11 11:43:55,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120195272] [2021-06-11 11:43:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:43:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:55,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-11 11:43:55,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:43:55,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,418 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:43:55,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:55,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:43:55,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:43:55,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:55,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:43:55,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:55,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:55,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:55,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-11 11:43:55,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2021-06-11 11:43:55,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369333584] [2021-06-11 11:43:55,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:43:55,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:55,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:43:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-11 11:43:55,469 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:43:55,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 770 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:43:55,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:55,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:43:55,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:43:56,034 INFO L129 PetriNetUnfolder]: 3099/4445 cut-off events. [2021-06-11 11:43:56,034 INFO L130 PetriNetUnfolder]: For 104161/104978 co-relation queries the response was YES. [2021-06-11 11:43:56,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31324 conditions, 4445 events. 3099/4445 cut-off events. For 104161/104978 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 23545 event pairs, 675 based on Foata normal form. 334/4385 useless extension candidates. Maximal degree in co-relation 31133. Up to 1813 conditions per place. [2021-06-11 11:43:56,205 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 57 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2021-06-11 11:43:56,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 102 transitions, 1362 flow [2021-06-11 11:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 11:43:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 11:43:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2021-06-11 11:43:56,206 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7355769230769231 [2021-06-11 11:43:56,206 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 153 transitions. [2021-06-11 11:43:56,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 153 transitions. [2021-06-11 11:43:56,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:43:56,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 153 transitions. [2021-06-11 11:43:56,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-06-11 11:43:56,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 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-06-11 11:43:56,208 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 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-06-11 11:43:56,208 INFO L185 Difference]: Start difference. First operand has 86 places, 68 transitions, 770 flow. Second operand 4 states and 153 transitions. [2021-06-11 11:43:56,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 102 transitions, 1362 flow [2021-06-11 11:43:56,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 1183 flow, removed 77 selfloop flow, removed 16 redundant places. [2021-06-11 11:43:56,378 INFO L241 Difference]: Finished difference. Result has 75 places, 79 transitions, 843 flow [2021-06-11 11:43:56,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=843, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2021-06-11 11:43:56,379 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2021-06-11 11:43:56,379 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:56,379 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 79 transitions, 843 flow [2021-06-11 11:43:56,379 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 79 transitions, 843 flow [2021-06-11 11:43:56,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 843 flow [2021-06-11 11:43:56,464 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][30], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 11#thread2EXITtrue, 267#true, 76#true, 14#L62-1true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-06-11 11:43:56,465 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 11:43:56,465 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:43:56,465 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 11:43:56,465 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:43:56,474 INFO L129 PetriNetUnfolder]: 585/1047 cut-off events. [2021-06-11 11:43:56,474 INFO L130 PetriNetUnfolder]: For 12500/12745 co-relation queries the response was YES. [2021-06-11 11:43:56,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6395 conditions, 1047 events. 585/1047 cut-off events. For 12500/12745 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5551 event pairs, 76 based on Foata normal form. 29/997 useless extension candidates. Maximal degree in co-relation 6202. Up to 546 conditions per place. [2021-06-11 11:43:56,497 INFO L151 LiptonReduction]: Number of co-enabled transitions 940 [2021-06-11 11:43:56,510 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:43:56,510 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:43:56,510 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 131 [2021-06-11 11:43:56,512 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 843 flow [2021-06-11 11:43:56,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:43:56,512 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:56,512 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] [2021-06-11 11:43:56,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:43:56,729 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:56,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1680079630, now seen corresponding path program 1 times [2021-06-11 11:43:56,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:56,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105736748] [2021-06-11 11:43:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:56,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:56,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:56,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:56,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:56,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:56,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:56,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105736748] [2021-06-11 11:43:56,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:43:56,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 11:43:56,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637951524] [2021-06-11 11:43:56,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:43:56,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:56,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:43:56,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 11:43:56,766 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:43:56,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 843 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:43:56,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:56,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:43:56,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:43:57,460 INFO L129 PetriNetUnfolder]: 3558/5257 cut-off events. [2021-06-11 11:43:57,460 INFO L130 PetriNetUnfolder]: For 65082/65931 co-relation queries the response was YES. [2021-06-11 11:43:57,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31935 conditions, 5257 events. 3558/5257 cut-off events. For 65082/65931 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 29921 event pairs, 272 based on Foata normal form. 402/5492 useless extension candidates. Maximal degree in co-relation 31502. Up to 2086 conditions per place. [2021-06-11 11:43:57,518 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 130 selfloop transitions, 19 changer transitions 7/179 dead transitions. [2021-06-11 11:43:57,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 179 transitions, 2337 flow [2021-06-11 11:43:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 11:43:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 11:43:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2021-06-11 11:43:57,519 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7346153846153847 [2021-06-11 11:43:57,520 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2021-06-11 11:43:57,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2021-06-11 11:43:57,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:43:57,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2021-06-11 11:43:57,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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-06-11 11:43:57,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:57,521 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:57,521 INFO L185 Difference]: Start difference. First operand has 75 places, 79 transitions, 843 flow. Second operand 5 states and 191 transitions. [2021-06-11 11:43:57,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 179 transitions, 2337 flow [2021-06-11 11:43:57,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 179 transitions, 2270 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-06-11 11:43:57,658 INFO L241 Difference]: Finished difference. Result has 79 places, 95 transitions, 1108 flow [2021-06-11 11:43:57,658 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1108, PETRI_PLACES=79, PETRI_TRANSITIONS=95} [2021-06-11 11:43:57,658 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 42 predicate places. [2021-06-11 11:43:57,658 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:57,658 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 95 transitions, 1108 flow [2021-06-11 11:43:57,659 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 95 transitions, 1108 flow [2021-06-11 11:43:57,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 95 transitions, 1108 flow [2021-06-11 11:43:57,764 INFO L129 PetriNetUnfolder]: 646/1245 cut-off events. [2021-06-11 11:43:57,764 INFO L130 PetriNetUnfolder]: For 14011/14407 co-relation queries the response was YES. [2021-06-11 11:43:57,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7418 conditions, 1245 events. 646/1245 cut-off events. For 14011/14407 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7495 event pairs, 87 based on Foata normal form. 80/1228 useless extension candidates. Maximal degree in co-relation 7149. Up to 621 conditions per place. [2021-06-11 11:43:57,790 INFO L151 LiptonReduction]: Number of co-enabled transitions 1174 [2021-06-11 11:43:57,804 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:43:57,804 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:43:57,804 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 146 [2021-06-11 11:43:57,805 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 95 transitions, 1108 flow [2021-06-11 11:43:57,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:43:57,805 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:57,805 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] [2021-06-11 11:43:57,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 11:43:57,805 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1656016788, now seen corresponding path program 2 times [2021-06-11 11:43:57,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:57,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706139213] [2021-06-11 11:43:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:57,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:57,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:57,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:57,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:57,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:57,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:57,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706139213] [2021-06-11 11:43:57,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:43:57,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 11:43:57,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759011861] [2021-06-11 11:43:57,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:43:57,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:57,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:43:57,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 11:43:57,832 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:43:57,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 95 transitions, 1108 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:43:57,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:57,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:43:57,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:43:58,391 INFO L129 PetriNetUnfolder]: 3407/5126 cut-off events. [2021-06-11 11:43:58,391 INFO L130 PetriNetUnfolder]: For 66930/67860 co-relation queries the response was YES. [2021-06-11 11:43:58,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32122 conditions, 5126 events. 3407/5126 cut-off events. For 66930/67860 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 30313 event pairs, 346 based on Foata normal form. 383/5330 useless extension candidates. Maximal degree in co-relation 31672. Up to 1969 conditions per place. [2021-06-11 11:43:58,526 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 132 selfloop transitions, 26 changer transitions 6/187 dead transitions. [2021-06-11 11:43:58,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 187 transitions, 2528 flow [2021-06-11 11:43:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 11:43:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 11:43:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2021-06-11 11:43:58,528 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7346153846153847 [2021-06-11 11:43:58,528 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2021-06-11 11:43:58,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2021-06-11 11:43:58,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:43:58,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2021-06-11 11:43:58,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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-06-11 11:43:58,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:58,529 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:58,529 INFO L185 Difference]: Start difference. First operand has 77 places, 95 transitions, 1108 flow. Second operand 5 states and 191 transitions. [2021-06-11 11:43:58,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 187 transitions, 2528 flow [2021-06-11 11:43:58,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 187 transitions, 2490 flow, removed 19 selfloop flow, removed 2 redundant places. [2021-06-11 11:43:58,594 INFO L241 Difference]: Finished difference. Result has 81 places, 113 transitions, 1417 flow [2021-06-11 11:43:58,594 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1417, PETRI_PLACES=81, PETRI_TRANSITIONS=113} [2021-06-11 11:43:58,594 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2021-06-11 11:43:58,594 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:58,594 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 113 transitions, 1417 flow [2021-06-11 11:43:58,595 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 113 transitions, 1417 flow [2021-06-11 11:43:58,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 113 transitions, 1417 flow [2021-06-11 11:43:58,728 INFO L129 PetriNetUnfolder]: 736/1396 cut-off events. [2021-06-11 11:43:58,728 INFO L130 PetriNetUnfolder]: For 15698/16078 co-relation queries the response was YES. [2021-06-11 11:43:58,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 1396 events. 736/1396 cut-off events. For 15698/16078 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8597 event pairs, 101 based on Foata normal form. 84/1377 useless extension candidates. Maximal degree in co-relation 8461. Up to 706 conditions per place. [2021-06-11 11:43:58,762 INFO L151 LiptonReduction]: Number of co-enabled transitions 1312 [2021-06-11 11:43:58,785 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:43:58,785 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:43:58,785 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 191 [2021-06-11 11:43:58,786 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 113 transitions, 1417 flow [2021-06-11 11:43:58,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:43:58,786 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:58,786 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] [2021-06-11 11:43:58,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 11:43:58,786 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash -458232876, now seen corresponding path program 3 times [2021-06-11 11:43:58,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:58,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621921896] [2021-06-11 11:43:58,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:58,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:58,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:58,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:58,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:43:58,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:58,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:58,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621921896] [2021-06-11 11:43:58,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:43:58,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 11:43:58,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735327877] [2021-06-11 11:43:58,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:43:58,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:58,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:43:58,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 11:43:58,808 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:43:58,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 113 transitions, 1417 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:43:58,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:58,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:43:58,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:43:59,409 INFO L129 PetriNetUnfolder]: 3513/5312 cut-off events. [2021-06-11 11:43:59,409 INFO L130 PetriNetUnfolder]: For 71126/72321 co-relation queries the response was YES. [2021-06-11 11:43:59,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34051 conditions, 5312 events. 3513/5312 cut-off events. For 71126/72321 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 32014 event pairs, 431 based on Foata normal form. 421/5497 useless extension candidates. Maximal degree in co-relation 33585. Up to 2141 conditions per place. [2021-06-11 11:43:59,464 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 149 selfloop transitions, 30 changer transitions 5/207 dead transitions. [2021-06-11 11:43:59,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 207 transitions, 2970 flow [2021-06-11 11:43:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 11:43:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 11:43:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2021-06-11 11:43:59,466 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7346153846153847 [2021-06-11 11:43:59,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2021-06-11 11:43:59,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2021-06-11 11:43:59,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:43:59,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2021-06-11 11:43:59,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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-06-11 11:43:59,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:59,467 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:43:59,467 INFO L185 Difference]: Start difference. First operand has 81 places, 113 transitions, 1417 flow. Second operand 5 states and 191 transitions. [2021-06-11 11:43:59,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 207 transitions, 2970 flow [2021-06-11 11:43:59,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 207 transitions, 2966 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-06-11 11:43:59,531 INFO L241 Difference]: Finished difference. Result has 87 places, 140 transitions, 1894 flow [2021-06-11 11:43:59,531 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1894, PETRI_PLACES=87, PETRI_TRANSITIONS=140} [2021-06-11 11:43:59,532 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 50 predicate places. [2021-06-11 11:43:59,532 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:43:59,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 140 transitions, 1894 flow [2021-06-11 11:43:59,532 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 140 transitions, 1894 flow [2021-06-11 11:43:59,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 140 transitions, 1894 flow [2021-06-11 11:43:59,670 INFO L129 PetriNetUnfolder]: 807/1514 cut-off events. [2021-06-11 11:43:59,671 INFO L130 PetriNetUnfolder]: For 20484/21153 co-relation queries the response was YES. [2021-06-11 11:43:59,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10425 conditions, 1514 events. 807/1514 cut-off events. For 20484/21153 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 9469 event pairs, 101 based on Foata normal form. 124/1504 useless extension candidates. Maximal degree in co-relation 10146. Up to 763 conditions per place. [2021-06-11 11:43:59,690 INFO L151 LiptonReduction]: Number of co-enabled transitions 1592 [2021-06-11 11:43:59,719 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:43:59,719 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:43:59,719 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 187 [2021-06-11 11:43:59,720 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 140 transitions, 1894 flow [2021-06-11 11:43:59,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:43:59,720 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:43:59,720 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] [2021-06-11 11:43:59,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 11:43:59,720 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:43:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:43:59,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1249508918, now seen corresponding path program 4 times [2021-06-11 11:43:59,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:43:59,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113514164] [2021-06-11 11:43:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:43:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:43:59,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:59,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:43:59,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:59,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:43:59,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:43:59,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:43:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:43:59,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113514164] [2021-06-11 11:43:59,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:43:59,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 11:43:59,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569025861] [2021-06-11 11:43:59,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:43:59,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:43:59,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:43:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 11:43:59,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:43:59,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 140 transitions, 1894 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:43:59,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:43:59,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:43:59,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:00,118 INFO L129 PetriNetUnfolder]: 2889/4342 cut-off events. [2021-06-11 11:44:00,118 INFO L130 PetriNetUnfolder]: For 64550/65831 co-relation queries the response was YES. [2021-06-11 11:44:00,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30694 conditions, 4342 events. 2889/4342 cut-off events. For 64550/65831 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 24796 event pairs, 633 based on Foata normal form. 347/4390 useless extension candidates. Maximal degree in co-relation 30322. Up to 2252 conditions per place. [2021-06-11 11:44:00,165 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 93 selfloop transitions, 41 changer transitions 1/158 dead transitions. [2021-06-11 11:44:00,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 158 transitions, 2398 flow [2021-06-11 11:44:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 11:44:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 11:44:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2021-06-11 11:44:00,167 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7355769230769231 [2021-06-11 11:44:00,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 153 transitions. [2021-06-11 11:44:00,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 153 transitions. [2021-06-11 11:44:00,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:00,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 153 transitions. [2021-06-11 11:44:00,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-06-11 11:44:00,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 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-06-11 11:44:00,169 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 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-06-11 11:44:00,169 INFO L185 Difference]: Start difference. First operand has 87 places, 140 transitions, 1894 flow. Second operand 4 states and 153 transitions. [2021-06-11 11:44:00,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 158 transitions, 2398 flow [2021-06-11 11:44:00,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 158 transitions, 2398 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 11:44:00,315 INFO L241 Difference]: Finished difference. Result has 91 places, 139 transitions, 1998 flow [2021-06-11 11:44:00,315 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1998, PETRI_PLACES=91, PETRI_TRANSITIONS=139} [2021-06-11 11:44:00,315 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 54 predicate places. [2021-06-11 11:44:00,316 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:00,316 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 139 transitions, 1998 flow [2021-06-11 11:44:00,316 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 139 transitions, 1998 flow [2021-06-11 11:44:00,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 139 transitions, 1998 flow [2021-06-11 11:44:00,423 INFO L129 PetriNetUnfolder]: 670/1233 cut-off events. [2021-06-11 11:44:00,423 INFO L130 PetriNetUnfolder]: For 18067/18603 co-relation queries the response was YES. [2021-06-11 11:44:00,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8915 conditions, 1233 events. 670/1233 cut-off events. For 18067/18603 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7343 event pairs, 84 based on Foata normal form. 111/1258 useless extension candidates. Maximal degree in co-relation 8728. Up to 637 conditions per place. [2021-06-11 11:44:00,447 INFO L151 LiptonReduction]: Number of co-enabled transitions 1490 [2021-06-11 11:44:00,465 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:00,465 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:00,465 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 149 [2021-06-11 11:44:00,465 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 139 transitions, 1998 flow [2021-06-11 11:44:00,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:44:00,466 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:00,466 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] [2021-06-11 11:44:00,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 11:44:00,466 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash -306177054, now seen corresponding path program 1 times [2021-06-11 11:44:00,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:00,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880240834] [2021-06-11 11:44:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:00,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:00,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:00,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:00,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:00,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:00,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:44:00,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880240834] [2021-06-11 11:44:00,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:44:00,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 11:44:00,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638393357] [2021-06-11 11:44:00,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:44:00,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:44:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 11:44:00,486 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:44:00,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 139 transitions, 1998 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:44:00,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:00,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:44:00,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:00,833 INFO L129 PetriNetUnfolder]: 2528/3683 cut-off events. [2021-06-11 11:44:00,833 INFO L130 PetriNetUnfolder]: For 64548/65690 co-relation queries the response was YES. [2021-06-11 11:44:00,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27773 conditions, 3683 events. 2528/3683 cut-off events. For 64548/65690 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 19840 event pairs, 407 based on Foata normal form. 331/3735 useless extension candidates. Maximal degree in co-relation 27555. Up to 1887 conditions per place. [2021-06-11 11:44:00,870 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 126 selfloop transitions, 33 changer transitions 25/207 dead transitions. [2021-06-11 11:44:00,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 207 transitions, 3364 flow [2021-06-11 11:44:00,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 11:44:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 11:44:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2021-06-11 11:44:00,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7346153846153847 [2021-06-11 11:44:00,871 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2021-06-11 11:44:00,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2021-06-11 11:44:00,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:00,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2021-06-11 11:44:00,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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-06-11 11:44:00,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:44:00,873 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:44:00,873 INFO L185 Difference]: Start difference. First operand has 91 places, 139 transitions, 1998 flow. Second operand 5 states and 191 transitions. [2021-06-11 11:44:00,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 207 transitions, 3364 flow [2021-06-11 11:44:00,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 207 transitions, 3294 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 11:44:00,939 INFO L241 Difference]: Finished difference. Result has 94 places, 134 transitions, 1996 flow [2021-06-11 11:44:00,939 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1996, PETRI_PLACES=94, PETRI_TRANSITIONS=134} [2021-06-11 11:44:00,939 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 57 predicate places. [2021-06-11 11:44:00,939 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:00,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 134 transitions, 1996 flow [2021-06-11 11:44:00,939 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 134 transitions, 1996 flow [2021-06-11 11:44:00,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 134 transitions, 1996 flow [2021-06-11 11:44:01,031 INFO L129 PetriNetUnfolder]: 547/994 cut-off events. [2021-06-11 11:44:01,031 INFO L130 PetriNetUnfolder]: For 14484/14866 co-relation queries the response was YES. [2021-06-11 11:44:01,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7428 conditions, 994 events. 547/994 cut-off events. For 14484/14866 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5522 event pairs, 65 based on Foata normal form. 71/1005 useless extension candidates. Maximal degree in co-relation 7299. Up to 541 conditions per place. [2021-06-11 11:44:01,048 INFO L151 LiptonReduction]: Number of co-enabled transitions 1336 [2021-06-11 11:44:01,055 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:01,055 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:01,055 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 116 [2021-06-11 11:44:01,055 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 134 transitions, 1996 flow [2021-06-11 11:44:01,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:44:01,056 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:01,056 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] [2021-06-11 11:44:01,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 11:44:01,056 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1204053262, now seen corresponding path program 2 times [2021-06-11 11:44:01,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:01,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144783974] [2021-06-11 11:44:01,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:01,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:01,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:01,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:01,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:01,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:01,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:44:01,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144783974] [2021-06-11 11:44:01,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:44:01,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 11:44:01,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507649146] [2021-06-11 11:44:01,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:44:01,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:01,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:44:01,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 11:44:01,077 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:44:01,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 134 transitions, 1996 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:44:01,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:01,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:44:01,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:01,476 INFO L129 PetriNetUnfolder]: 2568/3742 cut-off events. [2021-06-11 11:44:01,476 INFO L130 PetriNetUnfolder]: For 68448/69694 co-relation queries the response was YES. [2021-06-11 11:44:01,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28729 conditions, 3742 events. 2568/3742 cut-off events. For 68448/69694 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 20038 event pairs, 403 based on Foata normal form. 275/3756 useless extension candidates. Maximal degree in co-relation 28512. Up to 2170 conditions per place. [2021-06-11 11:44:01,513 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 160 selfloop transitions, 27 changer transitions 6/216 dead transitions. [2021-06-11 11:44:01,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 216 transitions, 3599 flow [2021-06-11 11:44:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 11:44:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 11:44:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2021-06-11 11:44:01,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7192307692307692 [2021-06-11 11:44:01,514 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 187 transitions. [2021-06-11 11:44:01,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 187 transitions. [2021-06-11 11:44:01,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:01,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 187 transitions. [2021-06-11 11:44:01,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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-06-11 11:44:01,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:44:01,516 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 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-06-11 11:44:01,516 INFO L185 Difference]: Start difference. First operand has 93 places, 134 transitions, 1996 flow. Second operand 5 states and 187 transitions. [2021-06-11 11:44:01,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 216 transitions, 3599 flow [2021-06-11 11:44:01,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 216 transitions, 3546 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-06-11 11:44:01,580 INFO L241 Difference]: Finished difference. Result has 98 places, 150 transitions, 2318 flow [2021-06-11 11:44:01,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2318, PETRI_PLACES=98, PETRI_TRANSITIONS=150} [2021-06-11 11:44:01,580 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2021-06-11 11:44:01,581 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:01,581 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 150 transitions, 2318 flow [2021-06-11 11:44:01,581 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 150 transitions, 2318 flow [2021-06-11 11:44:01,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 150 transitions, 2318 flow [2021-06-11 11:44:01,698 INFO L129 PetriNetUnfolder]: 634/1107 cut-off events. [2021-06-11 11:44:01,698 INFO L130 PetriNetUnfolder]: For 16630/16949 co-relation queries the response was YES. [2021-06-11 11:44:01,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8838 conditions, 1107 events. 634/1107 cut-off events. For 16630/16949 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6125 event pairs, 76 based on Foata normal form. 62/1099 useless extension candidates. Maximal degree in co-relation 8703. Up to 573 conditions per place. [2021-06-11 11:44:01,719 INFO L151 LiptonReduction]: Number of co-enabled transitions 1404 [2021-06-11 11:44:01,729 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:01,729 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:01,730 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 149 [2021-06-11 11:44:01,730 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 150 transitions, 2318 flow [2021-06-11 11:44:01,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:44:01,730 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:01,730 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] [2021-06-11 11:44:01,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 11:44:01,731 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash -605505822, now seen corresponding path program 3 times [2021-06-11 11:44:01,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:01,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306865852] [2021-06-11 11:44:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:01,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:01,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:01,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:01,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:01,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:01,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 11:44:01,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306865852] [2021-06-11 11:44:01,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 11:44:01,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 11:44:01,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943665368] [2021-06-11 11:44:01,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 11:44:01,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 11:44:01,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 11:44:01,752 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:44:01,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 150 transitions, 2318 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:44:01,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:01,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:44:01,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:02,102 INFO L129 PetriNetUnfolder]: 2249/3280 cut-off events. [2021-06-11 11:44:02,102 INFO L130 PetriNetUnfolder]: For 62170/63110 co-relation queries the response was YES. [2021-06-11 11:44:02,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26830 conditions, 3280 events. 2249/3280 cut-off events. For 62170/63110 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 16904 event pairs, 521 based on Foata normal form. 178/3258 useless extension candidates. Maximal degree in co-relation 26597. Up to 2289 conditions per place. [2021-06-11 11:44:02,133 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 101 selfloop transitions, 32 changer transitions 1/157 dead transitions. [2021-06-11 11:44:02,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 157 transitions, 2710 flow [2021-06-11 11:44:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 11:44:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 11:44:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2021-06-11 11:44:02,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2021-06-11 11:44:02,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 152 transitions. [2021-06-11 11:44:02,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 152 transitions. [2021-06-11 11:44:02,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:02,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 152 transitions. [2021-06-11 11:44:02,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-06-11 11:44:02,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 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-06-11 11:44:02,136 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 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-06-11 11:44:02,136 INFO L185 Difference]: Start difference. First operand has 98 places, 150 transitions, 2318 flow. Second operand 4 states and 152 transitions. [2021-06-11 11:44:02,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 157 transitions, 2710 flow [2021-06-11 11:44:02,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 157 transitions, 2668 flow, removed 21 selfloop flow, removed 0 redundant places. [2021-06-11 11:44:02,204 INFO L241 Difference]: Finished difference. Result has 102 places, 142 transitions, 2292 flow [2021-06-11 11:44:02,204 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2202, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2292, PETRI_PLACES=102, PETRI_TRANSITIONS=142} [2021-06-11 11:44:02,204 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2021-06-11 11:44:02,204 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:02,204 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 142 transitions, 2292 flow [2021-06-11 11:44:02,205 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 142 transitions, 2292 flow [2021-06-11 11:44:02,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 142 transitions, 2292 flow [2021-06-11 11:44:02,309 INFO L129 PetriNetUnfolder]: 642/1108 cut-off events. [2021-06-11 11:44:02,309 INFO L130 PetriNetUnfolder]: For 16379/16692 co-relation queries the response was YES. [2021-06-11 11:44:02,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8995 conditions, 1108 events. 642/1108 cut-off events. For 16379/16692 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6065 event pairs, 78 based on Foata normal form. 55/1094 useless extension candidates. Maximal degree in co-relation 8872. Up to 591 conditions per place. [2021-06-11 11:44:02,329 INFO L151 LiptonReduction]: Number of co-enabled transitions 1280 [2021-06-11 11:44:02,338 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:02,338 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:02,338 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 134 [2021-06-11 11:44:02,339 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 142 transitions, 2292 flow [2021-06-11 11:44:02,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-06-11 11:44:02,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:02,339 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] [2021-06-11 11:44:02,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 11:44:02,339 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:02,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:02,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2023630891, now seen corresponding path program 1 times [2021-06-11 11:44:02,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:02,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245513551] [2021-06-11 11:44:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:02,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:02,367 INFO L142 QuantifierPusher]: treesize reduction 28, result has 71.1 percent of original size [2021-06-11 11:44:02,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-06-11 11:44:02,391 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size [2021-06-11 11:44:02,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 11:44:02,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:02,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:02,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 11:44:02,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245513551] [2021-06-11 11:44:02,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667383745] [2021-06-11 11:44:02,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:02,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-11 11:44:02,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:44:02,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:02,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:02,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:44:02,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:02,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:02,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:44:02,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:02,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:02,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 11:44:02,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:44:02,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 9 [2021-06-11 11:44:02,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813732167] [2021-06-11 11:44:02,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 11:44:02,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:02,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 11:44:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-11 11:44:02,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2021-06-11 11:44:02,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 142 transitions, 2292 flow. Second operand has 10 states, 10 states have (on average 26.4) internal successors, (264), 10 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-06-11 11:44:02,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:02,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2021-06-11 11:44:02,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:03,857 INFO L129 PetriNetUnfolder]: 5437/7570 cut-off events. [2021-06-11 11:44:03,857 INFO L130 PetriNetUnfolder]: For 129188/129624 co-relation queries the response was YES. [2021-06-11 11:44:03,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61876 conditions, 7570 events. 5437/7570 cut-off events. For 129188/129624 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 40778 event pairs, 557 based on Foata normal form. 514/8083 useless extension candidates. Maximal degree in co-relation 61566. Up to 3436 conditions per place. [2021-06-11 11:44:03,917 INFO L132 encePairwiseOnDemand]: 43/52 looper letters, 142 selfloop transitions, 84 changer transitions 208/446 dead transitions. [2021-06-11 11:44:03,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 446 transitions, 7773 flow [2021-06-11 11:44:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-11 11:44:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-06-11 11:44:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 792 transitions. [2021-06-11 11:44:03,921 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6092307692307692 [2021-06-11 11:44:03,921 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 792 transitions. [2021-06-11 11:44:03,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 792 transitions. [2021-06-11 11:44:03,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:03,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 792 transitions. [2021-06-11 11:44:03,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 31.68) internal successors, (792), 25 states have internal predecessors, (792), 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-06-11 11:44:03,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 52.0) internal successors, (1352), 26 states have internal predecessors, (1352), 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-06-11 11:44:03,926 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 52.0) internal successors, (1352), 26 states have internal predecessors, (1352), 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-06-11 11:44:03,926 INFO L185 Difference]: Start difference. First operand has 102 places, 142 transitions, 2292 flow. Second operand 25 states and 792 transitions. [2021-06-11 11:44:03,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 446 transitions, 7773 flow [2021-06-11 11:44:04,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 446 transitions, 7587 flow, removed 38 selfloop flow, removed 4 redundant places. [2021-06-11 11:44:04,050 INFO L241 Difference]: Finished difference. Result has 133 places, 161 transitions, 2810 flow [2021-06-11 11:44:04,050 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2810, PETRI_PLACES=133, PETRI_TRANSITIONS=161} [2021-06-11 11:44:04,050 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 96 predicate places. [2021-06-11 11:44:04,051 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:04,051 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 161 transitions, 2810 flow [2021-06-11 11:44:04,051 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 161 transitions, 2810 flow [2021-06-11 11:44:04,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 161 transitions, 2810 flow [2021-06-11 11:44:04,136 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, Black: 512#(and v_assert (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 120#(= i 0), Black: 514#(and v_assert (<= k i) (<= min (+ max 1)) (< k N)), Black: 122#(<= min (select A 0)), Black: 516#(and v_assert (<= min (+ max 1))), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 406#(<= min (+ max 1)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 506#(and (<= k i) (<= min (+ max 1)) (< k N)), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), Black: 508#(and v_assert (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 19#thread2ENTRYtrue, 32#thread3EXITtrue, Black: 60#(not b1), 69#(not b2), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 349#(and (= j l) (<= N l)), Black: 79#(= min max), 97#true, 353#true, Black: 355#(= i l), Black: 358#(and (<= N l) (= i l)), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 367#(and (<= N l) (= k l)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), 377#true, Black: 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0)))]) [2021-06-11 11:44:04,136 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-06-11 11:44:04,136 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:44:04,136 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:04,136 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:44:04,177 INFO L129 PetriNetUnfolder]: 819/1342 cut-off events. [2021-06-11 11:44:04,177 INFO L130 PetriNetUnfolder]: For 40594/41367 co-relation queries the response was YES. [2021-06-11 11:44:04,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13461 conditions, 1342 events. 819/1342 cut-off events. For 40594/41367 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6988 event pairs, 124 based on Foata normal form. 15/1214 useless extension candidates. Maximal degree in co-relation 13398. Up to 731 conditions per place. [2021-06-11 11:44:04,209 INFO L151 LiptonReduction]: Number of co-enabled transitions 1354 [2021-06-11 11:44:04,217 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:04,217 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:04,217 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 166 [2021-06-11 11:44:04,218 INFO L480 AbstractCegarLoop]: Abstraction has has 113 places, 161 transitions, 2810 flow [2021-06-11 11:44:04,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 26.4) internal successors, (264), 10 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-06-11 11:44:04,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:04,218 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] [2021-06-11 11:44:04,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-11 11:44:04,419 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2095183454, now seen corresponding path program 1 times [2021-06-11 11:44:04,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:04,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038451704] [2021-06-11 11:44:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:04,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,452 INFO L142 QuantifierPusher]: treesize reduction 52, result has 50.0 percent of original size [2021-06-11 11:44:04,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-06-11 11:44:04,474 INFO L142 QuantifierPusher]: treesize reduction 28, result has 73.6 percent of original size [2021-06-11 11:44:04,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-06-11 11:44:04,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 11:44:04,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:44:04,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038451704] [2021-06-11 11:44:04,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889524277] [2021-06-11 11:44:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:04,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-11 11:44:04,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:44:04,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:04,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:04,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:04,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:04,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:04,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:04,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:04,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:04,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:04,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:04,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:04,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:04,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:04,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:04,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 11:44:04,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 11:44:04,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,665 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 11:44:04,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 11:44:04,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-11 11:44:04,669 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.2 percent of original size [2021-06-11 11:44:04,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,674 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 11:44:04,677 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,680 INFO L142 QuantifierPusher]: treesize reduction 5, result has 84.8 percent of original size [2021-06-11 11:44:04,682 INFO L147 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size 5 [2021-06-11 11:44:04,684 INFO L147 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size 5 [2021-06-11 11:44:04,684 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 11:44:04,685 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,686 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:04,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:04,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 11:44:04,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,690 INFO L142 QuantifierPusher]: treesize reduction 6, result has 64.7 percent of original size [2021-06-11 11:44:04,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:04,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:04,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-11 11:44:04,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,716 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-11 11:44:04,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-11 11:44:04,718 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-06-11 11:44:04,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,730 INFO L142 QuantifierPusher]: treesize reduction 23, result has 17.9 percent of original size [2021-06-11 11:44:04,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:04,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,732 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:04,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:04,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-06-11 11:44:04,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:04,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:44:04,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:44:04,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-06-11 11:44:04,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236194969] [2021-06-11 11:44:04,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-11 11:44:04,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-11 11:44:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-11 11:44:04,759 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 52 [2021-06-11 11:44:04,759 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 161 transitions, 2810 flow. Second operand has 11 states, 11 states have (on average 31.454545454545453) internal successors, (346), 11 states have internal predecessors, (346), 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-06-11 11:44:04,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:04,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 52 [2021-06-11 11:44:04,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:05,357 INFO L129 PetriNetUnfolder]: 2114/3110 cut-off events. [2021-06-11 11:44:05,357 INFO L130 PetriNetUnfolder]: For 109446/110634 co-relation queries the response was YES. [2021-06-11 11:44:05,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33189 conditions, 3110 events. 2114/3110 cut-off events. For 109446/110634 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 15981 event pairs, 350 based on Foata normal form. 26/3036 useless extension candidates. Maximal degree in co-relation 33113. Up to 1702 conditions per place. [2021-06-11 11:44:05,395 INFO L132 encePairwiseOnDemand]: 43/52 looper letters, 128 selfloop transitions, 54 changer transitions 124/320 dead transitions. [2021-06-11 11:44:05,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 320 transitions, 6667 flow [2021-06-11 11:44:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-11 11:44:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-11 11:44:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 463 transitions. [2021-06-11 11:44:05,397 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6849112426035503 [2021-06-11 11:44:05,397 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 463 transitions. [2021-06-11 11:44:05,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 463 transitions. [2021-06-11 11:44:05,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:05,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 463 transitions. [2021-06-11 11:44:05,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 35.61538461538461) internal successors, (463), 13 states have internal predecessors, (463), 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-06-11 11:44:05,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 52.0) internal successors, (728), 14 states have internal predecessors, (728), 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-06-11 11:44:05,400 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 52.0) internal successors, (728), 14 states have internal predecessors, (728), 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-06-11 11:44:05,400 INFO L185 Difference]: Start difference. First operand has 113 places, 161 transitions, 2810 flow. Second operand 13 states and 463 transitions. [2021-06-11 11:44:05,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 320 transitions, 6667 flow [2021-06-11 11:44:05,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 320 transitions, 6007 flow, removed 296 selfloop flow, removed 13 redundant places. [2021-06-11 11:44:05,531 INFO L241 Difference]: Finished difference. Result has 121 places, 160 transitions, 2809 flow [2021-06-11 11:44:05,531 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2543, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2809, PETRI_PLACES=121, PETRI_TRANSITIONS=160} [2021-06-11 11:44:05,531 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2021-06-11 11:44:05,531 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:05,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 160 transitions, 2809 flow [2021-06-11 11:44:05,532 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 160 transitions, 2809 flow [2021-06-11 11:44:05,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 160 transitions, 2809 flow [2021-06-11 11:44:05,630 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 530#true, 22#L38true, 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 97#true, 353#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 11:44:05,630 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 11:44:05,630 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:44:05,630 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:05,630 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:05,641 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 536#(<= min max), 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 11:44:05,641 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 11:44:05,641 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:44:05,641 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:05,641 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:05,664 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 530#true, 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 69#(not b2), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 11:44:05,664 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 11:44:05,664 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:05,664 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:05,665 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:05,674 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 530#true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), 380#(<= N j), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 11:44:05,674 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:44:05,675 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:05,675 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:05,675 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:05,683 INFO L129 PetriNetUnfolder]: 918/1569 cut-off events. [2021-06-11 11:44:05,683 INFO L130 PetriNetUnfolder]: For 44935/45940 co-relation queries the response was YES. [2021-06-11 11:44:05,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15314 conditions, 1569 events. 918/1569 cut-off events. For 44935/45940 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8820 event pairs, 145 based on Foata normal form. 26/1409 useless extension candidates. Maximal degree in co-relation 15251. Up to 870 conditions per place. [2021-06-11 11:44:05,724 INFO L151 LiptonReduction]: Number of co-enabled transitions 1324 [2021-06-11 11:44:05,740 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:05,740 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:05,740 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 209 [2021-06-11 11:44:05,740 INFO L480 AbstractCegarLoop]: Abstraction has has 116 places, 160 transitions, 2809 flow [2021-06-11 11:44:05,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 31.454545454545453) internal successors, (346), 11 states have internal predecessors, (346), 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-06-11 11:44:05,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:05,741 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] [2021-06-11 11:44:05,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:05,958 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:05,958 INFO L82 PathProgramCache]: Analyzing trace with hash 233999450, now seen corresponding path program 2 times [2021-06-11 11:44:05,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:05,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745834668] [2021-06-11 11:44:05,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:05,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:05,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:05,984 INFO L142 QuantifierPusher]: treesize reduction 28, result has 45.1 percent of original size [2021-06-11 11:44:05,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 11:44:06,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:06,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:44:06,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745834668] [2021-06-11 11:44:06,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893969323] [2021-06-11 11:44:06,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:06,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-11 11:44:06,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 11:44:06,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-11 11:44:06,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:44:06,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:06,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:06,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:06,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:06,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:06,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:06,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:06,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:06,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:06,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:06,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 11:44:06,113 INFO L147 QuantifierPusher]: treesize reduction 2, result has 93.1 percent of original size 27 [2021-06-11 11:44:06,114 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.3 percent of original size [2021-06-11 11:44:06,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:06,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 11:44:06,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 11:44:06,119 INFO L142 QuantifierPusher]: treesize reduction 17, result has 41.4 percent of original size [2021-06-11 11:44:06,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:06,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:06,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:06,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:06,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:06,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:06,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:06,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:06,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:06,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:06,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,128 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:06,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:06,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:06,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-11 11:44:06,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,134 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-11 11:44:06,135 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,136 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-11 11:44:06,136 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-06-11 11:44:06,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,143 INFO L142 QuantifierPusher]: treesize reduction 23, result has 17.9 percent of original size [2021-06-11 11:44:06,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:06,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,145 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:06,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:06,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-06-11 11:44:06,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:06,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:44:06,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:44:06,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 11:44:06,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125404046] [2021-06-11 11:44:06,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 11:44:06,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 11:44:06,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 11:44:06,167 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 52 [2021-06-11 11:44:06,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 160 transitions, 2809 flow. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 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-06-11 11:44:06,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:06,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 52 [2021-06-11 11:44:06,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:06,611 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][43], [Black: 227#(and (= i 0) (<= min (select A 0))), 641#(= j 0), 385#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 530#true, 22#L38true, 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 11:44:06,611 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 11:44:06,611 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:06,611 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:06,611 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:06,666 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][221], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 536#(<= min max), 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, 730#(and (<= min max) (= j 0)), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 11:44:06,667 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 11:44:06,667 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:06,667 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 11:44:06,667 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:44:06,806 INFO L129 PetriNetUnfolder]: 2471/3880 cut-off events. [2021-06-11 11:44:06,806 INFO L130 PetriNetUnfolder]: For 112496/113560 co-relation queries the response was YES. [2021-06-11 11:44:06,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41245 conditions, 3880 events. 2471/3880 cut-off events. For 112496/113560 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 22932 event pairs, 204 based on Foata normal form. 21/3582 useless extension candidates. Maximal degree in co-relation 41157. Up to 2264 conditions per place. [2021-06-11 11:44:06,854 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 110 selfloop transitions, 59 changer transitions 223/407 dead transitions. [2021-06-11 11:44:06,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 407 transitions, 8498 flow [2021-06-11 11:44:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-11 11:44:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-06-11 11:44:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 653 transitions. [2021-06-11 11:44:06,857 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7386877828054299 [2021-06-11 11:44:06,857 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 653 transitions. [2021-06-11 11:44:06,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 653 transitions. [2021-06-11 11:44:06,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:06,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 653 transitions. [2021-06-11 11:44:06,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 38.411764705882355) internal successors, (653), 17 states have internal predecessors, (653), 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-06-11 11:44:06,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 52.0) internal successors, (936), 18 states have internal predecessors, (936), 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-06-11 11:44:06,860 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 52.0) internal successors, (936), 18 states have internal predecessors, (936), 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-06-11 11:44:06,860 INFO L185 Difference]: Start difference. First operand has 116 places, 160 transitions, 2809 flow. Second operand 17 states and 653 transitions. [2021-06-11 11:44:06,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 407 transitions, 8498 flow [2021-06-11 11:44:06,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 407 transitions, 7958 flow, removed 228 selfloop flow, removed 8 redundant places. [2021-06-11 11:44:06,997 INFO L241 Difference]: Finished difference. Result has 135 places, 139 transitions, 2559 flow [2021-06-11 11:44:06,997 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2651, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2559, PETRI_PLACES=135, PETRI_TRANSITIONS=139} [2021-06-11 11:44:06,997 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 98 predicate places. [2021-06-11 11:44:06,998 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:06,998 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 139 transitions, 2559 flow [2021-06-11 11:44:06,998 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 139 transitions, 2559 flow [2021-06-11 11:44:06,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 139 transitions, 2559 flow [2021-06-11 11:44:07,069 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][66], [Black: 227#(and (= i 0) (<= min (select A 0))), 641#(= j 0), 385#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 19#thread2ENTRYtrue, 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 644#(<= min max), 362#true, Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0))]) [2021-06-11 11:44:07,069 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-06-11 11:44:07,069 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:44:07,069 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:44:07,069 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 11:44:07,156 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][66], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, 641#(= j 0), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 69#(not b2), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 644#(<= min max), Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), 362#true, Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0))]) [2021-06-11 11:44:07,156 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 11:44:07,156 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:07,156 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:07,156 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:07,169 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][66], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 355#(= i l), Black: 644#(<= min max), Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), 362#true, Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), 639#true]) [2021-06-11 11:44:07,169 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 11:44:07,169 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:07,169 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:07,170 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:07,179 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][66], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 644#(<= min max), Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), 362#true, Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), 639#true]) [2021-06-11 11:44:07,179 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:44:07,179 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:07,179 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:07,179 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:07,188 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][33], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 40#L86true, Black: 60#(not b1), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 644#(<= min max), Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), 362#true, Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), 639#true]) [2021-06-11 11:44:07,188 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 11:44:07,189 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:44:07,189 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:44:07,189 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:44:07,194 INFO L129 PetriNetUnfolder]: 1155/1923 cut-off events. [2021-06-11 11:44:07,194 INFO L130 PetriNetUnfolder]: For 68420/69366 co-relation queries the response was YES. [2021-06-11 11:44:07,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19980 conditions, 1923 events. 1155/1923 cut-off events. For 68420/69366 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 11003 event pairs, 237 based on Foata normal form. 28/1693 useless extension candidates. Maximal degree in co-relation 19887. Up to 1075 conditions per place. [2021-06-11 11:44:07,244 INFO L151 LiptonReduction]: Number of co-enabled transitions 1096 [2021-06-11 11:44:07,254 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:07,254 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:07,254 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 256 [2021-06-11 11:44:07,255 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 139 transitions, 2559 flow [2021-06-11 11:44:07,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 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-06-11 11:44:07,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:07,255 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] [2021-06-11 11:44:07,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-11 11:44:07,469 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:07,469 INFO L82 PathProgramCache]: Analyzing trace with hash 782326286, now seen corresponding path program 3 times [2021-06-11 11:44:07,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:07,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162709506] [2021-06-11 11:44:07,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:07,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,498 INFO L142 QuantifierPusher]: treesize reduction 14, result has 56.3 percent of original size [2021-06-11 11:44:07,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 11:44:07,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:07,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-11 11:44:07,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162709506] [2021-06-11 11:44:07,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206478517] [2021-06-11 11:44:07,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:07,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-11 11:44:07,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 11:44:07,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-11 11:44:07,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:44:07,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:07,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:07,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:07,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:07,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:07,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:07,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:07,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:07,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:07,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:07,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:07,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 11:44:07,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:07,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:07,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 11:44:07,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:07,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:07,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 11:44:07,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 11:44:07,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-06-11 11:44:07,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:07,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:07,633 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-11 11:44:07,635 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:07,635 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-11 11:44:07,635 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2021-06-11 11:44:07,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:07,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:07,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 11:44:07,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:07,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 11:44:07,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:07,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:07,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 11:44:07,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 11:44:07,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-11 11:44:07,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,649 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-11 11:44:07,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-11 11:44:07,652 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-06-11 11:44:07,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,661 INFO L142 QuantifierPusher]: treesize reduction 23, result has 23.3 percent of original size [2021-06-11 11:44:07,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:07,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,664 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:07,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:07,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:44:07,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:07,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-11 11:44:07,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:44:07,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 11:44:07,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498233950] [2021-06-11 11:44:07,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 11:44:07,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 11:44:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-11 11:44:07,693 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 52 [2021-06-11 11:44:07,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 139 transitions, 2559 flow. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 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-06-11 11:44:07,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:07,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 52 [2021-06-11 11:44:07,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:08,366 INFO L129 PetriNetUnfolder]: 3117/4962 cut-off events. [2021-06-11 11:44:08,366 INFO L130 PetriNetUnfolder]: For 161564/162521 co-relation queries the response was YES. [2021-06-11 11:44:08,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53568 conditions, 4962 events. 3117/4962 cut-off events. For 161564/162521 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 31267 event pairs, 390 based on Foata normal form. 33/4605 useless extension candidates. Maximal degree in co-relation 53430. Up to 2731 conditions per place. [2021-06-11 11:44:08,414 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 130 selfloop transitions, 34 changer transitions 150/329 dead transitions. [2021-06-11 11:44:08,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 329 transitions, 7019 flow [2021-06-11 11:44:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 11:44:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 11:44:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 387 transitions. [2021-06-11 11:44:08,415 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7442307692307693 [2021-06-11 11:44:08,415 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 387 transitions. [2021-06-11 11:44:08,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 387 transitions. [2021-06-11 11:44:08,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:08,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 387 transitions. [2021-06-11 11:44:08,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 38.7) internal successors, (387), 10 states have internal predecessors, (387), 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-06-11 11:44:08,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 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-06-11 11:44:08,417 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 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-06-11 11:44:08,417 INFO L185 Difference]: Start difference. First operand has 122 places, 139 transitions, 2559 flow. Second operand 10 states and 387 transitions. [2021-06-11 11:44:08,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 329 transitions, 7019 flow [2021-06-11 11:44:08,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 329 transitions, 6548 flow, removed 215 selfloop flow, removed 12 redundant places. [2021-06-11 11:44:08,594 INFO L241 Difference]: Finished difference. Result has 125 places, 146 transitions, 2679 flow [2021-06-11 11:44:08,594 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2374, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2679, PETRI_PLACES=125, PETRI_TRANSITIONS=146} [2021-06-11 11:44:08,594 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 88 predicate places. [2021-06-11 11:44:08,594 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:08,594 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 146 transitions, 2679 flow [2021-06-11 11:44:08,595 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 146 transitions, 2679 flow [2021-06-11 11:44:08,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 146 transitions, 2679 flow [2021-06-11 11:44:08,707 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 641#(= j 0), 385#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 756#(<= min (+ max 1)), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max)]) [2021-06-11 11:44:08,707 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-06-11 11:44:08,707 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:44:08,707 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:44:08,707 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 11:44:08,763 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 756#(<= min (+ max 1)), Black: 69#(not b2), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:08,763 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 11:44:08,763 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:08,763 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:08,763 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:08,776 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), Black: 756#(<= min (+ max 1)), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:08,776 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 11:44:08,776 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:08,776 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:08,776 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:08,782 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 756#(<= min (+ max 1)), Black: 69#(not b2), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:08,782 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-06-11 11:44:08,782 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 11:44:08,782 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 11:44:08,782 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 11:44:08,782 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 756#(<= min (+ max 1)), Black: 69#(not b2), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:08,782 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:44:08,782 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:08,782 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:08,782 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:08,782 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:08,797 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 643#(<= (select A 0) max), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), Black: 756#(<= min (+ max 1)), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:08,797 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:08,798 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:08,798 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:08,798 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:08,811 INFO L129 PetriNetUnfolder]: 1559/2556 cut-off events. [2021-06-11 11:44:08,811 INFO L130 PetriNetUnfolder]: For 83759/84973 co-relation queries the response was YES. [2021-06-11 11:44:08,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25785 conditions, 2556 events. 1559/2556 cut-off events. For 83759/84973 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 15061 event pairs, 316 based on Foata normal form. 23/2232 useless extension candidates. Maximal degree in co-relation 25672. Up to 1469 conditions per place. [2021-06-11 11:44:08,855 INFO L151 LiptonReduction]: Number of co-enabled transitions 1174 [2021-06-11 11:44:08,864 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:08,864 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:08,865 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 271 [2021-06-11 11:44:08,865 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 146 transitions, 2679 flow [2021-06-11 11:44:08,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 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-06-11 11:44:08,865 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:08,865 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 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-06-11 11:44:09,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:09,069 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash -426316000, now seen corresponding path program 4 times [2021-06-11 11:44:09,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:09,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841407276] [2021-06-11 11:44:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:09,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:09,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:44:09,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841407276] [2021-06-11 11:44:09,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117829117] [2021-06-11 11:44:09,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:09,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-11 11:44:09,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 11:44:09,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-11 11:44:09,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:44:09,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:09,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:09,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:09,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:44:09,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:09,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:09,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:09,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:44:09,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,170 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:09,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:09,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:44:09,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:09,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:09,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:44:09,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:09,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:09,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:44:09,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:09,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:09,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:09,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:09,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:09,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:09,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:09,207 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-06-11 11:44:09,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:09,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:44:09,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:44:09,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 11:44:09,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050152219] [2021-06-11 11:44:09,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 11:44:09,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:09,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 11:44:09,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-11 11:44:09,224 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:44:09,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 146 transitions, 2679 flow. Second operand has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 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-06-11 11:44:09,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:09,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:44:09,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:11,218 INFO L129 PetriNetUnfolder]: 12993/18794 cut-off events. [2021-06-11 11:44:11,218 INFO L130 PetriNetUnfolder]: For 518967/519226 co-relation queries the response was YES. [2021-06-11 11:44:11,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176053 conditions, 18794 events. 12993/18794 cut-off events. For 518967/519226 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 119176 event pairs, 3038 based on Foata normal form. 1520/20074 useless extension candidates. Maximal degree in co-relation 175840. Up to 8197 conditions per place. [2021-06-11 11:44:11,545 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 213 selfloop transitions, 114 changer transitions 0/351 dead transitions. [2021-06-11 11:44:11,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 351 transitions, 7168 flow [2021-06-11 11:44:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 11:44:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 11:44:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 271 transitions. [2021-06-11 11:44:11,546 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7445054945054945 [2021-06-11 11:44:11,546 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 271 transitions. [2021-06-11 11:44:11,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 271 transitions. [2021-06-11 11:44:11,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:11,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 271 transitions. [2021-06-11 11:44:11,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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-06-11 11:44:11,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 52.0) internal successors, (416), 8 states have internal predecessors, (416), 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-06-11 11:44:11,548 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 52.0) internal successors, (416), 8 states have internal predecessors, (416), 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-06-11 11:44:11,548 INFO L185 Difference]: Start difference. First operand has 121 places, 146 transitions, 2679 flow. Second operand 7 states and 271 transitions. [2021-06-11 11:44:11,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 351 transitions, 7168 flow [2021-06-11 11:44:12,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 351 transitions, 7000 flow, removed 84 selfloop flow, removed 4 redundant places. [2021-06-11 11:44:12,300 INFO L241 Difference]: Finished difference. Result has 127 places, 247 transitions, 5242 flow [2021-06-11 11:44:12,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5242, PETRI_PLACES=127, PETRI_TRANSITIONS=247} [2021-06-11 11:44:12,300 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 90 predicate places. [2021-06-11 11:44:12,300 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:12,301 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 247 transitions, 5242 flow [2021-06-11 11:44:12,301 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 247 transitions, 5242 flow [2021-06-11 11:44:12,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 247 transitions, 5242 flow [2021-06-11 11:44:13,011 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][185], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:13,011 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:44:13,011 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:13,011 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:13,011 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:13,130 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][158], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:13,130 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 11:44:13,130 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 11:44:13,130 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:44:13,130 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 11:44:13,132 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][149], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:13,132 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:13,132 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:13,132 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:13,132 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:13,165 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][185], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:13,165 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:13,165 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:13,165 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:13,165 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:13,186 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][158], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:13,186 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-06-11 11:44:13,186 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 11:44:13,186 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:44:13,186 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:44:13,215 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][80], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), 38#thread4EXITtrue, Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 365#(<= N l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:13,215 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 11:44:13,215 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:13,215 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:13,215 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:13,226 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][152], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 40#L86true, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:13,227 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-06-11 11:44:13,227 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 11:44:13,227 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 11:44:13,227 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 11:44:13,255 INFO L129 PetriNetUnfolder]: 5379/9314 cut-off events. [2021-06-11 11:44:13,255 INFO L130 PetriNetUnfolder]: For 270749/273258 co-relation queries the response was YES. [2021-06-11 11:44:13,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91804 conditions, 9314 events. 5379/9314 cut-off events. For 270749/273258 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 73876 event pairs, 1204 based on Foata normal form. 150/8564 useless extension candidates. Maximal degree in co-relation 90622. Up to 4877 conditions per place. [2021-06-11 11:44:13,453 INFO L151 LiptonReduction]: Number of co-enabled transitions 2180 [2021-06-11 11:44:13,499 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:13,500 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:13,500 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1200 [2021-06-11 11:44:13,500 INFO L480 AbstractCegarLoop]: Abstraction has has 127 places, 247 transitions, 5242 flow [2021-06-11 11:44:13,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 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-06-11 11:44:13,501 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:13,501 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 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-06-11 11:44:13,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:13,723 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:13,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:13,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1121631106, now seen corresponding path program 5 times [2021-06-11 11:44:13,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:13,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001852015] [2021-06-11 11:44:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:13,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:13,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:44:13,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001852015] [2021-06-11 11:44:13,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571284493] [2021-06-11 11:44:13,760 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:13,814 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-11 11:44:13,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 11:44:13,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-11 11:44:13,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:44:13,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,830 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:13,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:13,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:44:13,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,835 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:13,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:13,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:44:13,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,843 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-06-11 11:44:13,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:13,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:13,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:13,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:44:13,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:13,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:13,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:13,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:13,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:13,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:13,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:13,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:13,863 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-06-11 11:44:13,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:13,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:44:13,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:44:13,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 11:44:13,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573733652] [2021-06-11 11:44:13,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 11:44:13,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:13,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 11:44:13,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 11:44:13,890 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:44:13,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 247 transitions, 5242 flow. Second operand has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 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-06-11 11:44:13,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:13,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:44:13,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:20,719 INFO L129 PetriNetUnfolder]: 27891/41691 cut-off events. [2021-06-11 11:44:20,719 INFO L130 PetriNetUnfolder]: For 1260324/1260913 co-relation queries the response was YES. [2021-06-11 11:44:21,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392819 conditions, 41691 events. 27891/41691 cut-off events. For 1260324/1260913 co-relation queries the response was YES. Maximal size of possible extension queue 2608. Compared 314078 event pairs, 2422 based on Foata normal form. 604/42178 useless extension candidates. Maximal degree in co-relation 388985. Up to 16683 conditions per place. [2021-06-11 11:44:21,254 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 543 selfloop transitions, 153 changer transitions 13/733 dead transitions. [2021-06-11 11:44:21,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 733 transitions, 17815 flow [2021-06-11 11:44:21,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 11:44:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 11:44:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 345 transitions. [2021-06-11 11:44:21,255 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2021-06-11 11:44:21,255 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 345 transitions. [2021-06-11 11:44:21,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 345 transitions. [2021-06-11 11:44:21,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:21,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 345 transitions. [2021-06-11 11:44:21,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 38.333333333333336) internal successors, (345), 9 states have internal predecessors, (345), 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-06-11 11:44:21,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-06-11 11:44:21,257 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-06-11 11:44:21,257 INFO L185 Difference]: Start difference. First operand has 127 places, 247 transitions, 5242 flow. Second operand 9 states and 345 transitions. [2021-06-11 11:44:21,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 733 transitions, 17815 flow [2021-06-11 11:44:22,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 733 transitions, 17044 flow, removed 378 selfloop flow, removed 1 redundant places. [2021-06-11 11:44:22,433 INFO L241 Difference]: Finished difference. Result has 138 places, 380 transitions, 8938 flow [2021-06-11 11:44:22,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=5055, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8938, PETRI_PLACES=138, PETRI_TRANSITIONS=380} [2021-06-11 11:44:22,434 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 101 predicate places. [2021-06-11 11:44:22,434 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:22,434 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 380 transitions, 8938 flow [2021-06-11 11:44:22,434 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 380 transitions, 8938 flow [2021-06-11 11:44:22,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 380 transitions, 8938 flow [2021-06-11 11:44:24,598 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:24,598 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 11:44:24,598 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:24,598 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:24,598 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:25,058 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][24], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:25,059 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:44:25,059 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:25,059 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:25,059 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:25,307 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:25,307 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 11:44:25,307 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:44:25,307 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:44:25,307 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:44:25,307 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:25,307 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,307 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:25,308 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:25,308 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:25,308 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:25,323 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 643#(<= (select A 0) max), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j)]) [2021-06-11 11:44:25,323 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,323 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,323 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,323 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:25,480 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:25,480 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,480 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,480 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,480 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,514 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][33], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:25,514 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,514 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,514 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,514 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:25,703 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:25,703 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,703 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,703 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,703 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,721 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:25,721 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,721 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,721 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,721 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,725 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][33], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 11:44:25,725 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,725 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,725 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,725 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:25,785 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j)]) [2021-06-11 11:44:25,785 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 11:44:25,785 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:44:25,785 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:44:25,785 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:26,203 INFO L129 PetriNetUnfolder]: 13931/24425 cut-off events. [2021-06-11 11:44:26,203 INFO L130 PetriNetUnfolder]: For 834302/844972 co-relation queries the response was YES. [2021-06-11 11:44:26,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235440 conditions, 24425 events. 13931/24425 cut-off events. For 834302/844972 co-relation queries the response was YES. Maximal size of possible extension queue 2227. Compared 223085 event pairs, 2652 based on Foata normal form. 504/22826 useless extension candidates. Maximal degree in co-relation 232027. Up to 12314 conditions per place. [2021-06-11 11:44:26,792 INFO L151 LiptonReduction]: Number of co-enabled transitions 3630 [2021-06-11 11:44:26,867 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:26,867 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:26,867 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4433 [2021-06-11 11:44:26,867 INFO L480 AbstractCegarLoop]: Abstraction has has 138 places, 380 transitions, 8938 flow [2021-06-11 11:44:26,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 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-06-11 11:44:26,868 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:26,868 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 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-06-11 11:44:27,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-11 11:44:27,081 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:44:27,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:44:27,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1346243092, now seen corresponding path program 6 times [2021-06-11 11:44:27,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:44:27,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960075607] [2021-06-11 11:44:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:44:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:44:27,100 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-06-11 11:44:27,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:27,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:44:27,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960075607] [2021-06-11 11:44:27,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272563496] [2021-06-11 11:44:27,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:44:27,164 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-11 11:44:27,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 11:44:27,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-11 11:44:27,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:44:27,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:27,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:27,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:44:27,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:27,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:44:27,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:44:27,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:44:27,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,204 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:27,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:27,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:27,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:27,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:44:27,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:44:27,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:27,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:27,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:44:27,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:44:27,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:44:27,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:44:27,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:44:27,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:44:27,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:44:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 11:44:27,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:44:27,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-06-11 11:44:27,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72136674] [2021-06-11 11:44:27,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 11:44:27,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:44:27,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 11:44:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-11 11:44:27,252 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 52 [2021-06-11 11:44:27,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 380 transitions, 8938 flow. Second operand has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 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-06-11 11:44:27,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:44:27,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 52 [2021-06-11 11:44:27,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:44:41,128 INFO L129 PetriNetUnfolder]: 48796/72465 cut-off events. [2021-06-11 11:44:41,128 INFO L130 PetriNetUnfolder]: For 2278609/2280246 co-relation queries the response was YES. [2021-06-11 11:44:42,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 718065 conditions, 72465 events. 48796/72465 cut-off events. For 2278609/2280246 co-relation queries the response was YES. Maximal size of possible extension queue 4726. Compared 574526 event pairs, 4461 based on Foata normal form. 2533/74758 useless extension candidates. Maximal degree in co-relation 712453. Up to 28434 conditions per place. [2021-06-11 11:44:42,454 INFO L132 encePairwiseOnDemand]: 45/52 looper letters, 590 selfloop transitions, 635 changer transitions 9/1258 dead transitions. [2021-06-11 11:44:42,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1258 transitions, 30060 flow [2021-06-11 11:44:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-11 11:44:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-06-11 11:44:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 990 transitions. [2021-06-11 11:44:42,456 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7322485207100592 [2021-06-11 11:44:42,456 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 990 transitions. [2021-06-11 11:44:42,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 990 transitions. [2021-06-11 11:44:42,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:44:42,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 990 transitions. [2021-06-11 11:44:42,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 38.07692307692308) internal successors, (990), 26 states have internal predecessors, (990), 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-06-11 11:44:42,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 52.0) internal successors, (1404), 27 states have internal predecessors, (1404), 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-06-11 11:44:42,460 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 52.0) internal successors, (1404), 27 states have internal predecessors, (1404), 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-06-11 11:44:42,460 INFO L185 Difference]: Start difference. First operand has 138 places, 380 transitions, 8938 flow. Second operand 26 states and 990 transitions. [2021-06-11 11:44:42,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1258 transitions, 30060 flow [2021-06-11 11:44:48,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 1258 transitions, 29738 flow, removed 147 selfloop flow, removed 1 redundant places. [2021-06-11 11:44:48,675 INFO L241 Difference]: Finished difference. Result has 178 places, 917 transitions, 24200 flow [2021-06-11 11:44:48,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=8796, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=24200, PETRI_PLACES=178, PETRI_TRANSITIONS=917} [2021-06-11 11:44:48,676 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 141 predicate places. [2021-06-11 11:44:48,676 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:44:48,677 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 917 transitions, 24200 flow [2021-06-11 11:44:48,677 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 917 transitions, 24200 flow [2021-06-11 11:44:48,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 917 transitions, 24200 flow [2021-06-11 11:44:51,880 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][787], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, 641#(= j 0), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), 844#true, 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:51,880 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 11:44:51,880 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:44:51,880 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 11:44:51,881 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 11:44:54,982 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1141#(and (<= N l) (<= k l)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:54,982 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:44:54,982 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:54,982 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:54,982 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:44:55,474 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][787], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), 641#(= j 0), 385#true, Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:55,474 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:44:55,474 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:55,474 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:55,474 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:55,994 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][143], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:55,995 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 11:44:55,995 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:44:55,995 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:44:55,995 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:44:56,000 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:56,000 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:56,000 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:56,000 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:56,000 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:44:56,094 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][166], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), 8#L51-1true, Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:56,094 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:56,094 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:56,094 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:56,094 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:56,095 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:56,095 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:44:56,096 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:56,096 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:56,096 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:44:56,941 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][787], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:56,941 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:56,941 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:56,941 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:56,941 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:56,960 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][787], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 643#(<= (select A 0) max), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:56,960 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:56,960 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:56,960 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:56,961 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,100 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][166], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), 4#thread5EXITtrue, 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:57,100 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,100 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,100 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,100 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,105 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][166], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:57,105 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,105 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,105 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,105 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,107 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][166], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:57,108 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,108 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,108 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,108 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,109 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:57,109 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,109 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,109 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,109 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,110 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:57,110 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,110 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,110 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,110 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:44:57,408 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:57,408 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 11:44:57,408 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:44:57,408 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:44:57,408 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:44:57,891 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][607], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), 38#thread4EXITtrue, Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 40#L86true, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 365#(<= N l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1141#(and (<= N l) (<= k l)), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:44:57,892 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-06-11 11:44:57,892 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 11:44:57,892 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-06-11 11:44:57,892 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-06-11 11:44:58,322 INFO L129 PetriNetUnfolder]: 25442/44149 cut-off events. [2021-06-11 11:44:58,322 INFO L130 PetriNetUnfolder]: For 1763964/1784546 co-relation queries the response was YES. [2021-06-11 11:44:58,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 460944 conditions, 44149 events. 25442/44149 cut-off events. For 1763964/1784546 co-relation queries the response was YES. Maximal size of possible extension queue 3951. Compared 429352 event pairs, 4856 based on Foata normal form. 1129/41911 useless extension candidates. Maximal degree in co-relation 454797. Up to 21725 conditions per place. [2021-06-11 11:44:59,740 INFO L151 LiptonReduction]: Number of co-enabled transitions 8518 [2021-06-11 11:44:59,996 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:44:59,996 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:44:59,996 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11320 [2021-06-11 11:44:59,997 INFO L480 AbstractCegarLoop]: Abstraction has has 178 places, 917 transitions, 24200 flow [2021-06-11 11:44:59,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 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-06-11 11:44:59,997 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:44:59,997 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 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-06-11 11:45:00,212 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:45:00,213 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:45:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:45:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash -869186482, now seen corresponding path program 7 times [2021-06-11 11:45:00,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:45:00,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329271539] [2021-06-11 11:45:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:45:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:45:00,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:45:00,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:45:00,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329271539] [2021-06-11 11:45:00,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501844569] [2021-06-11 11:45:00,259 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:45:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:45:00,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-11 11:45:00,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:45:00,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:45:00,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,335 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:00,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:45:00,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:45:00,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,353 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:00,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:45:00,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:45:00,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:00,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:45:00,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:45:00,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,365 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-06-11 11:45:00,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:45:00,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:00,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:45:00,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:45:00,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:00,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:00,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:45:00,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:45:00,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:00,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:45:00,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:45:00,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:00,376 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-06-11 11:45:00,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:00,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:45:00,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:45:00,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 11:45:00,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212809553] [2021-06-11 11:45:00,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 11:45:00,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:45:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 11:45:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 11:45:00,399 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 11:45:00,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 917 transitions, 24200 flow. Second operand has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 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-06-11 11:45:00,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:45:00,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 11:45:00,404 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:45:21,671 INFO L129 PetriNetUnfolder]: 46714/69489 cut-off events. [2021-06-11 11:45:21,672 INFO L130 PetriNetUnfolder]: For 2666916/2669128 co-relation queries the response was YES. [2021-06-11 11:45:22,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751418 conditions, 69489 events. 46714/69489 cut-off events. For 2666916/2669128 co-relation queries the response was YES. Maximal size of possible extension queue 4681. Compared 550523 event pairs, 5508 based on Foata normal form. 1834/71114 useless extension candidates. Maximal degree in co-relation 746087. Up to 26985 conditions per place. [2021-06-11 11:45:23,359 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 599 selfloop transitions, 625 changer transitions 13/1261 dead transitions. [2021-06-11 11:45:23,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1261 transitions, 35097 flow [2021-06-11 11:45:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 11:45:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 11:45:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 345 transitions. [2021-06-11 11:45:23,360 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2021-06-11 11:45:23,360 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 345 transitions. [2021-06-11 11:45:23,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 345 transitions. [2021-06-11 11:45:23,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:45:23,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 345 transitions. [2021-06-11 11:45:23,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 38.333333333333336) internal successors, (345), 9 states have internal predecessors, (345), 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-06-11 11:45:23,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-06-11 11:45:23,362 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 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-06-11 11:45:23,362 INFO L185 Difference]: Start difference. First operand has 178 places, 917 transitions, 24200 flow. Second operand 9 states and 345 transitions. [2021-06-11 11:45:23,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1261 transitions, 35097 flow [2021-06-11 11:45:38,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 1261 transitions, 33753 flow, removed 667 selfloop flow, removed 1 redundant places. [2021-06-11 11:45:38,154 INFO L241 Difference]: Finished difference. Result has 189 places, 1097 transitions, 30644 flow [2021-06-11 11:45:38,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=23144, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=917, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=463, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=30644, PETRI_PLACES=189, PETRI_TRANSITIONS=1097} [2021-06-11 11:45:38,155 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 152 predicate places. [2021-06-11 11:45:38,155 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:45:38,155 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 1097 transitions, 30644 flow [2021-06-11 11:45:38,155 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 1097 transitions, 30644 flow [2021-06-11 11:45:38,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 189 places, 1097 transitions, 30644 flow [2021-06-11 11:45:41,643 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), 641#(= j 0), 385#true, Black: 1033#(<= k l), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), 844#true, 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:41,643 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 11:45:41,643 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 11:45:41,643 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 11:45:41,643 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:45:43,836 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), 1030#true, Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), 8#L51-1true, Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 14#L62-1true, Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:43,836 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 11:45:43,836 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:45:43,836 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:45:43,836 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:45:45,347 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, 641#(= j 0), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, 400#true, Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:45,348 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:45:45,348 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:45,348 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:45,348 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:46,279 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][856], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), 4#thread5EXITtrue, Black: 1034#(<= k (+ l 1)), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:46,279 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 11:45:46,279 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:45:46,279 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:45:46,279 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:45:46,282 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, 1167#true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:46,282 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,282 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,282 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,282 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,288 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:46,289 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 11:45:46,289 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:45:46,289 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:45:46,289 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:45:46,289 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:46,289 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,289 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:46,289 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:46,289 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:46,289 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:46,386 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][898], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), 8#L51-1true, Black: 387#(= k j), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 1176#(<= k l), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:46,386 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,386 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,386 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,386 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,410 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][333], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:46,411 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,411 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,411 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:46,411 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,929 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][78], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), 38#thread4EXITtrue, Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 365#(<= N l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), 1139#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 122#(<= min (select A 0)), Black: 536#(<= min max), 380#(<= N j), 1022#(and (<= N l) (<= i l)), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:46,929 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 11:45:46,929 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:46,929 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:46,929 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:46,966 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), 1167#true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:46,966 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:45:46,966 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:46,966 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:46,966 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:46,972 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][319], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:46,972 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:45:46,972 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:46,972 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:46,972 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,016 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][856], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,017 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,017 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,017 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,017 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,021 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][333], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), 4#thread5EXITtrue, Black: 1034#(<= k (+ l 1)), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,021 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-06-11 11:45:47,021 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 11:45:47,021 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 11:45:47,021 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 11:45:47,024 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,024 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,024 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,024 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,024 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,025 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), 1167#true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,025 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,025 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,025 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,025 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,027 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][319], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,027 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,027 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,027 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,027 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,030 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][319], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,031 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,031 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,031 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,031 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,039 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,040 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,040 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,040 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,040 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:47,136 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][78], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), 38#thread4EXITtrue, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 365#(<= N l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 1139#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), 1022#(and (<= N l) (<= i l)), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,136 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 11:45:47,137 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:45:47,137 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,137 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:45:47,324 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][333], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,324 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 11:45:47,324 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:45:47,324 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:45:47,324 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:45:47,339 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,339 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 11:45:47,339 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:45:47,339 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:45:47,339 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:45:47,343 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,343 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 11:45:47,343 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:45:47,343 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:45:47,343 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:45:47,497 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,497 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 11:45:47,497 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 11:45:47,497 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:45:47,497 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 11:45:47,983 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][716], [Black: 1125#(and (<= k l) (<= i l)), 1024#(and (<= i (+ l 1)) (<= N l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), 38#thread4EXITtrue, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 40#L86true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1176#(<= k l), 365#(<= N l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), 1137#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:47,983 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-06-11 11:45:47,983 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 11:45:47,989 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 11:45:47,989 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 11:45:48,010 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][716], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 4#thread5EXITtrue, 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), 38#thread4EXITtrue, Black: 853#(<= k l), 40#L86true, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1176#(<= k l), 365#(<= N l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), 1141#(and (<= N l) (<= k l)), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:48,011 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-06-11 11:45:48,011 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-06-11 11:45:48,011 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-06-11 11:45:48,011 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 11:45:48,047 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][716], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), 1024#(and (<= i (+ l 1)) (<= N l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 191#(and (= i 0) (<= j i)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 405#(<= min (+ (select A 0) 1)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), 38#thread4EXITtrue, 40#L86true, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 365#(<= N l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), 1137#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 11:45:48,047 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2021-06-11 11:45:48,047 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 11:45:48,047 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 11:45:48,047 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 11:45:48,118 INFO L129 PetriNetUnfolder]: 23928/41928 cut-off events. [2021-06-11 11:45:48,118 INFO L130 PetriNetUnfolder]: For 1725831/1746657 co-relation queries the response was YES. [2021-06-11 11:45:48,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 438621 conditions, 41928 events. 23928/41928 cut-off events. For 1725831/1746657 co-relation queries the response was YES. Maximal size of possible extension queue 3912. Compared 411989 event pairs, 4063 based on Foata normal form. 1289/40416 useless extension candidates. Maximal degree in co-relation 432673. Up to 20089 conditions per place. [2021-06-11 11:45:49,571 INFO L151 LiptonReduction]: Number of co-enabled transitions 10100 [2021-06-11 11:45:49,814 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:45:49,814 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:45:49,814 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11659 [2021-06-11 11:45:49,814 INFO L480 AbstractCegarLoop]: Abstraction has has 189 places, 1097 transitions, 30644 flow [2021-06-11 11:45:49,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 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-06-11 11:45:49,814 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:45:49,815 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 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-06-11 11:45:50,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:45:50,015 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:45:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:45:50,016 INFO L82 PathProgramCache]: Analyzing trace with hash 806926026, now seen corresponding path program 8 times [2021-06-11 11:45:50,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:45:50,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995041003] [2021-06-11 11:45:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:45:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:45:50,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:45:50,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 11:45:50,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995041003] [2021-06-11 11:45:50,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486828965] [2021-06-11 11:45:50,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:45:50,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-11 11:45:50,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 11:45:50,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-11 11:45:50,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:45:50,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:50,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:45:50,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:45:50,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:50,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:45:50,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:45:50,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:50,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:45:50,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:45:50,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:50,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:45:50,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:45:50,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:45:50,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:50,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:45:50,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:45:50,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:45:50,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:45:50,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:45:50,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:45:50,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:45:50,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:45:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 11:45:50,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:45:50,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-06-11 11:45:50,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881281792] [2021-06-11 11:45:50,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 11:45:50,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:45:50,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 11:45:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-11 11:45:50,200 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 52 [2021-06-11 11:45:50,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1097 transitions, 30644 flow. Second operand has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 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-06-11 11:45:50,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:45:50,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 52 [2021-06-11 11:45:50,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:46:43,416 INFO L129 PetriNetUnfolder]: 92987/138534 cut-off events. [2021-06-11 11:46:43,416 INFO L130 PetriNetUnfolder]: For 5984505/5987396 co-relation queries the response was YES. [2021-06-11 11:46:45,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1578295 conditions, 138534 events. 92987/138534 cut-off events. For 5984505/5987396 co-relation queries the response was YES. Maximal size of possible extension queue 9512. Compared 1189071 event pairs, 10549 based on Foata normal form. 18574/156467 useless extension candidates. Maximal degree in co-relation 1569030. Up to 59112 conditions per place. [2021-06-11 11:46:46,730 INFO L132 encePairwiseOnDemand]: 45/52 looper letters, 2846 selfloop transitions, 838 changer transitions 59/3767 dead transitions. [2021-06-11 11:46:46,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 3767 transitions, 111636 flow [2021-06-11 11:46:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-11 11:46:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-06-11 11:46:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 873 transitions. [2021-06-11 11:46:46,732 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.729933110367893 [2021-06-11 11:46:46,732 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 873 transitions. [2021-06-11 11:46:46,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 873 transitions. [2021-06-11 11:46:46,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:46:46,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 873 transitions. [2021-06-11 11:46:46,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 37.95652173913044) internal successors, (873), 23 states have internal predecessors, (873), 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-06-11 11:46:46,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 52.0) internal successors, (1248), 24 states have internal predecessors, (1248), 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-06-11 11:46:46,735 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 52.0) internal successors, (1248), 24 states have internal predecessors, (1248), 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-06-11 11:46:46,735 INFO L185 Difference]: Start difference. First operand has 189 places, 1097 transitions, 30644 flow. Second operand 23 states and 873 transitions. [2021-06-11 11:46:46,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 3767 transitions, 111636 flow [2021-06-11 11:48:00,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 3767 transitions, 109389 flow, removed 1117 selfloop flow, removed 1 redundant places. [2021-06-11 11:48:00,379 INFO L241 Difference]: Finished difference. Result has 227 places, 1751 transitions, 50712 flow [2021-06-11 11:48:00,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=28552, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=50712, PETRI_PLACES=227, PETRI_TRANSITIONS=1751} [2021-06-11 11:48:00,380 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 190 predicate places. [2021-06-11 11:48:00,380 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 11:48:00,381 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 1751 transitions, 50712 flow [2021-06-11 11:48:00,381 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 1751 transitions, 50712 flow [2021-06-11 11:48:00,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 1751 transitions, 50712 flow [2021-06-11 11:48:04,321 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][148], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 46#L25true, Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, 1121#(and (< i N) (<= i l)), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), 374#(<= (+ i 1) N), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), 120#(= i 0), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 946#(<= i l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:04,321 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 11:48:04,321 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:48:04,321 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 11:48:04,321 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 11:48:04,629 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][379], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 38#thread4EXITtrue, 46#L25true, Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 1133#(and (<= N l) (< i N)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), 374#(<= (+ i 1) N), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), 120#(= i 0), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1172#(<= N l), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1022#(and (<= N l) (<= i l))]) [2021-06-11 11:48:04,629 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2021-06-11 11:48:04,629 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-06-11 11:48:04,629 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 11:48:04,629 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 11:48:07,506 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][77], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 1121#(and (< i N) (<= i l)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), 374#(<= (+ i 1) N), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), 120#(= i 0), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 946#(<= i l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:07,506 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 11:48:07,506 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:48:07,506 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:48:07,506 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:10,812 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:10,812 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 11:48:10,812 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:48:10,812 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:10,812 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 11:48:16,416 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][1228], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, 1035#(<= N l), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 38#thread4EXITtrue, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1172#(<= N l), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:16,416 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 11:48:16,416 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:16,416 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:16,416 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:16,417 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:16,417 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 11:48:16,417 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:16,417 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:16,417 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:16,692 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1590], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1176#(<= k l), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:16,692 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:48:16,692 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:16,692 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:16,692 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:17,079 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][77], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 1052#(<= i (+ l 1)), 32#thread3EXITtrue, 34#L83true, 44#L27-1true, Black: 60#(not b1), 1348#(and (< i N) (<= i l)), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 122#(<= min (select A 0)), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 940#(<= i (+ l 1)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:17,080 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-06-11 11:48:17,080 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 11:48:17,080 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 11:48:17,080 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:48:17,111 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][77], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:17,112 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:48:17,112 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:17,112 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:17,112 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:17,137 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:17,137 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-06-11 11:48:17,137 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 11:48:17,137 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:48:17,137 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 11:48:17,138 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:17,138 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:48:17,138 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:17,138 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:17,138 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:17,138 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 1167#true, Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:17,138 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:48:17,138 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:17,138 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 11:48:17,138 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:17,138 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,281 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1563], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:21,281 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,281 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,281 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,281 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,406 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 1364#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 641#(= j 0), 385#true, Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, 207#(and (< j N) (<= j i)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-06-11 11:48:21,406 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,406 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,406 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,406 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,448 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:21,448 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:48:21,448 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,448 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:21,448 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:22,770 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][281], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:22,771 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:48:22,771 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:22,771 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:22,771 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:23,157 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 1167#true, Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:23,158 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:48:23,158 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:23,158 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:23,158 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:23,158 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:25,469 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:25,469 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:48:25,469 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:25,469 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 11:48:25,469 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:25,955 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:25,955 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:48:25,955 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:25,955 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:25,955 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:26,513 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1590], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1176#(<= k l), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:26,513 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,513 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,513 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,513 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,837 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:26,837 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,837 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,837 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,837 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,855 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1128], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:26,855 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,855 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,855 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:26,855 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:27,348 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:27,348 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:48:27,348 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:27,348 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:27,348 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:27,348 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 11:48:27,926 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][281], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:27,926 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:48:27,926 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:27,926 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:27,926 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:29,462 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][77], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1022#(and (<= N l) (<= i l))]) [2021-06-11 11:48:29,462 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:48:29,462 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:29,462 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:29,462 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:30,345 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1541], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:30,345 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:48:30,345 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:30,345 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:30,345 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,154 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:31,155 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,155 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,155 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,155 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,156 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1541], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:31,156 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,156 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,156 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,156 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,253 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][281], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:31,253 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,253 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,253 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,254 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,259 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1541], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:31,259 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,259 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,259 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,259 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 11:48:31,652 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][281], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:31,652 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 11:48:31,652 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:48:31,652 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:48:31,652 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 11:48:31,656 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), 365#(<= N l), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:31,656 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 11:48:31,656 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:31,656 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:31,656 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,256 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:33,256 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,256 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,256 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,256 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,458 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 1147#(and (<= N l) (<= k (+ l 1))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:33,458 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,458 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,458 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,458 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,459 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:33,459 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,459 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,459 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,459 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,739 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][587], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 33#thread5ENTRYtrue, 40#L86true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 1167#true, Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:33,739 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 11:48:33,739 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 11:48:33,739 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,739 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,899 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1541], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 11:48:33,899 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 11:48:33,900 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,900 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:33,900 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 11:48:34,843 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][587], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 33#thread5ENTRYtrue, 38#thread4EXITtrue, 40#L86true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), 365#(<= N l), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1022#(and (<= N l) (<= i l))]) [2021-06-11 11:48:34,843 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-06-11 11:48:34,843 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 11:48:34,843 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 11:48:34,843 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 11:48:35,367 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][587], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 38#thread4EXITtrue, 40#L86true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1022#(and (<= N l) (<= i l))]) [2021-06-11 11:48:35,368 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2021-06-11 11:48:35,368 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 11:48:35,368 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 11:48:35,368 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 11:48:35,561 INFO L129 PetriNetUnfolder]: 62280/103435 cut-off events. [2021-06-11 11:48:35,561 INFO L130 PetriNetUnfolder]: For 5280783/5337373 co-relation queries the response was YES. [2021-06-11 11:48:37,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1253623 conditions, 103435 events. 62280/103435 cut-off events. For 5280783/5337373 co-relation queries the response was YES. Maximal size of possible extension queue 9570. Compared 1062169 event pairs, 14189 based on Foata normal form. 3308/100457 useless extension candidates. Maximal degree in co-relation 1244021. Up to 46044 conditions per place. [2021-06-11 11:48:40,044 INFO L151 LiptonReduction]: Number of co-enabled transitions 14674 [2021-06-11 11:48:40,685 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 11:48:40,685 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 11:48:40,685 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40305 [2021-06-11 11:48:40,686 INFO L480 AbstractCegarLoop]: Abstraction has has 227 places, 1751 transitions, 50712 flow [2021-06-11 11:48:40,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 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-06-11 11:48:40,686 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 11:48:40,686 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 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-06-11 11:48:40,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-11 11:48:40,886 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 11:48:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 11:48:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2125783297, now seen corresponding path program 9 times [2021-06-11 11:48:40,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 11:48:40,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272173219] [2021-06-11 11:48:40,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 11:48:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 11:48:40,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:48:40,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:40,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:40,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:40,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:48:40,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272173219] [2021-06-11 11:48:40,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762245524] [2021-06-11 11:48:40,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 11:48:40,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-11 11:48:40,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 11:48:40,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-11 11:48:40,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 11:48:40,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:48:40,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:48:40,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 11:48:40,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 11:48:40,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:40,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:40,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,005 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:48:41,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:48:41,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:48:41,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:48:41,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:48:41,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:48:41,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:48:41,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:48:41,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:48:41,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,020 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:48:41,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 11:48:41,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 11:48:41,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 11:48:41,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,042 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:48:41,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:48:41,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:48:41,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,044 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 11:48:41,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 11:48:41,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 11:48:41,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 11:48:41,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 11:48:41,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 11:48:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 11:48:41,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 11:48:41,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-06-11 11:48:41,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238111128] [2021-06-11 11:48:41,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 11:48:41,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 11:48:41,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 11:48:41,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-11 11:48:41,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 52 [2021-06-11 11:48:41,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 1751 transitions, 50712 flow. Second operand has 10 states, 10 states have (on average 32.8) internal successors, (328), 10 states have internal predecessors, (328), 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-06-11 11:48:41,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 11:48:41,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 52 [2021-06-11 11:48:41,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 11:51:33,986 INFO L129 PetriNetUnfolder]: 195908/295613 cut-off events. [2021-06-11 11:51:34,007 INFO L130 PetriNetUnfolder]: For 17350399/17357316 co-relation queries the response was YES. [2021-06-11 11:51:40,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3925336 conditions, 295613 events. 195908/295613 cut-off events. For 17350399/17357316 co-relation queries the response was YES. Maximal size of possible extension queue 19834. Compared 2811749 event pairs, 26316 based on Foata normal form. 12613/307156 useless extension candidates. Maximal degree in co-relation 3907504. Up to 132704 conditions per place. [2021-06-11 11:51:42,306 INFO L132 encePairwiseOnDemand]: 45/52 looper letters, 4958 selfloop transitions, 2465 changer transitions 16/7463 dead transitions. [2021-06-11 11:51:42,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 7463 transitions, 224618 flow [2021-06-11 11:51:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-11 11:51:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-06-11 11:51:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 878 transitions. [2021-06-11 11:51:42,308 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7341137123745819 [2021-06-11 11:51:42,308 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 878 transitions. [2021-06-11 11:51:42,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 878 transitions. [2021-06-11 11:51:42,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 11:51:42,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 878 transitions. [2021-06-11 11:51:42,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 38.17391304347826) internal successors, (878), 23 states have internal predecessors, (878), 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-06-11 11:51:42,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 52.0) internal successors, (1248), 24 states have internal predecessors, (1248), 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-06-11 11:51:42,311 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 52.0) internal successors, (1248), 24 states have internal predecessors, (1248), 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-06-11 11:51:42,311 INFO L185 Difference]: Start difference. First operand has 227 places, 1751 transitions, 50712 flow. Second operand 23 states and 878 transitions. [2021-06-11 11:51:42,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 7463 transitions, 224618 flow Received shutdown request... [2021-06-11 11:56:40,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-11 11:56:40,589 WARN L545 AbstractCegarLoop]: Verification canceled [2021-06-11 11:56:40,591 WARN L224 ceAbstractionStarter]: Timeout [2021-06-11 11:56:40,591 INFO L202 PluginConnector]: Adding new model min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 11:56:40 BasicIcfg [2021-06-11 11:56:40,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 11:56:40,592 INFO L168 Benchmark]: Toolchain (without parser) took 769532.17 ms. Allocated memory was 417.3 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 396.7 MB in the beginning and 8.0 GB in the end (delta: -7.6 GB). Peak memory consumption was 9.2 GB. Max. memory is 16.0 GB. [2021-06-11 11:56:40,592 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.83 ms. Allocated memory is still 417.3 MB. Free memory is still 397.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 11:56:40,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.97 ms. Allocated memory is still 417.3 MB. Free memory was 396.7 MB in the beginning and 395.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 11:56:40,592 INFO L168 Benchmark]: Boogie Preprocessor took 25.89 ms. Allocated memory is still 417.3 MB. Free memory was 395.1 MB in the beginning and 394.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 11:56:40,592 INFO L168 Benchmark]: RCFGBuilder took 293.59 ms. Allocated memory is still 417.3 MB. Free memory was 394.0 MB in the beginning and 379.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-06-11 11:56:40,592 INFO L168 Benchmark]: TraceAbstraction took 769173.31 ms. Allocated memory was 417.3 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 378.9 MB in the beginning and 8.0 GB in the end (delta: -7.6 GB). Peak memory consumption was 9.2 GB. Max. memory is 16.0 GB. [2021-06-11 11:56:40,593 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.83 ms. Allocated memory is still 417.3 MB. Free memory is still 397.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 27.97 ms. Allocated memory is still 417.3 MB. Free memory was 396.7 MB in the beginning and 395.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 25.89 ms. Allocated memory is still 417.3 MB. Free memory was 395.1 MB in the beginning and 394.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 293.59 ms. Allocated memory is still 417.3 MB. Free memory was 394.0 MB in the beginning and 379.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 769173.31 ms. Allocated memory was 417.3 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 378.9 MB in the beginning and 8.0 GB in the end (delta: -7.6 GB). Peak memory consumption was 9.2 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 441.6ms, 47 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 25 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 348 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 271, positive: 262, positive conditional: 0, positive unconditional: 262, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, positive: 223, positive conditional: 0, positive unconditional: 223, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 232, positive: 223, positive conditional: 0, positive unconditional: 223, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 232, positive: 223, positive conditional: 0, positive unconditional: 223, 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: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 271, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 232, unknown conditional: 0, unknown unconditional: 232] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.4ms, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 56 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, 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: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.6ms, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 60 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, 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: 0, negative unconditional: 1, 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: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.0ms, 52 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.2ms, 54 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.7ms, 102 PlacesBefore, 86 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 824 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 130.9ms, 75 PlacesBefore, 75 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 145.6ms, 79 PlacesBefore, 77 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 190.2ms, 81 PlacesBefore, 81 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 1312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 186.8ms, 87 PlacesBefore, 87 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 1592 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 148.9ms, 91 PlacesBefore, 91 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 1490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.4ms, 94 PlacesBefore, 93 PlacesAfterwards, 134 TransitionsBefore, 134 TransitionsAfterwards, 1336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 148.6ms, 98 PlacesBefore, 98 PlacesAfterwards, 150 TransitionsBefore, 150 TransitionsAfterwards, 1404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.4ms, 102 PlacesBefore, 102 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 1280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 166.3ms, 133 PlacesBefore, 113 PlacesAfterwards, 161 TransitionsBefore, 161 TransitionsAfterwards, 1354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 208.0ms, 121 PlacesBefore, 116 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 1324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 256.2ms, 135 PlacesBefore, 122 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 1096 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 269.9ms, 125 PlacesBefore, 121 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1198.9ms, 127 PlacesBefore, 127 PlacesAfterwards, 247 TransitionsBefore, 247 TransitionsAfterwards, 2180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4432.8ms, 138 PlacesBefore, 138 PlacesAfterwards, 380 TransitionsBefore, 380 TransitionsAfterwards, 3630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11319.5ms, 178 PlacesBefore, 178 PlacesAfterwards, 917 TransitionsBefore, 917 TransitionsAfterwards, 8518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11658.3ms, 189 PlacesBefore, 189 PlacesAfterwards, 1097 TransitionsBefore, 1097 TransitionsAfterwards, 10100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40304.3ms, 227 PlacesBefore, 227 PlacesAfterwards, 1751 TransitionsBefore, 1751 TransitionsAfterwards, 14674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 90). Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 15.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 769014.2ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 0.0ms, AutomataDifference: 691498.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 545.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 156 SDtfs, 937 SDslu, 294 SDs, 0 SdLazy, 2074 SolverSat, 470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1489.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 1913.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=50712occurred in iteration=22, InterpolantAutomatonStates: 234, 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: 160.3ms SsaConstructionTime, 336.8ms SatisfiabilityAnalysisTime, 2134.2ms InterpolantComputationTime, 836 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 801 ConstructedInterpolants, 0 QuantifiedInterpolants, 2221 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1219 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 35 InterpolantComputations, 12 PerfectInterpolantSequences, 69/113 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