/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 16:08:42,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 16:08:42,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 16:08:42,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 16:08:42,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 16:08:42,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 16:08:42,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 16:08:42,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 16:08:42,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 16:08:42,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 16:08:42,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 16:08:42,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 16:08:42,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 16:08:42,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 16:08:42,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 16:08:42,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 16:08:42,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 16:08:42,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 16:08:42,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 16:08:42,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 16:08:42,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 16:08:42,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 16:08:42,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 16:08:42,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 16:08:42,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 16:08:42,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 16:08:42,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 16:08:42,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 16:08:42,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 16:08:42,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 16:08:42,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 16:08:42,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 16:08:42,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 16:08:42,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 16:08:42,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 16:08:42,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 16:08:42,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 16:08:42,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 16:08:42,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 16:08:42,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 16:08:42,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 16:08:42,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 16:08:42,613 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 16:08:42,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 16:08:42,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 16:08:42,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 16:08:42,618 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 16:08:42,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 16:08:42,618 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 16:08:42,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 16:08:42,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 16:08:42,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 16:08:42,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 16:08:42,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 16:08:42,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 16:08:42,620 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 16:08:42,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 16:08:42,620 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 16:08:42,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 16:08:42,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 16:08:42,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 16:08:42,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 16:08:42,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 16:08:42,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 16:08:42,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 16:08:42,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 16:08:42,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 16:08:42,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 16:08:42,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 16:08:42,622 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 16:08:42,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 16:08:42,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 16:08:42,622 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 16:08:42,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 16:08:42,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 16:08:42,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 16:08:42,915 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-26 16:08:42,916 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-26 16:08:42,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl [2021-03-26 16:08:42,917 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2021-03-26 16:08:42,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 16:08:42,961 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-26 16:08:42,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 16:08:42,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 16:08:42,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 16:08:42,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... [2021-03-26 16:08:42,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... [2021-03-26 16:08:42,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 16:08:42,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 16:08:42,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 16:08:42,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 16:08:42,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... [2021-03-26 16:08:42,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... [2021-03-26 16:08:42,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... [2021-03-26 16:08:42,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... [2021-03-26 16:08:42,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... [2021-03-26 16:08:42,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... [2021-03-26 16:08:42,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... [2021-03-26 16:08:42,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 16:08:42,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 16:08:42,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 16:08:42,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 16:08:43,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 16:08:43,055 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-26 16:08:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-26 16:08:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-26 16:08:43,056 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-26 16:08:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-26 16:08:43,056 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-26 16:08:43,056 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-26 16:08:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 16:08:43,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 16:08:43,056 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-26 16:08:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-26 16:08:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-26 16:08:43,057 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 16:08:43,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 16:08:43,239 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-26 16:08:43,241 INFO L202 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 04:08:43 BoogieIcfgContainer [2021-03-26 16:08:43,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 16:08:43,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 16:08:43,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 16:08:43,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 16:08:43,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 04:08:42" (1/2) ... [2021-03-26 16:08:43,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a34664e and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 04:08:43, skipping insertion in model container [2021-03-26 16:08:43,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 04:08:43" (2/2) ... [2021-03-26 16:08:43,246 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2021-03-26 16:08:43,251 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 16:08:43,254 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 16:08:43,254 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 16:08:43,294 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-03-26 16:08:43,319 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-26 16:08:43,345 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 16:08:43,346 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 16:08:43,357 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 16:08:43,357 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 16:08:43,357 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 16:08:43,357 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 16:08:43,357 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 16:08:43,357 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 16:08:43,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 82 flow [2021-03-26 16:08:43,382 INFO L129 PetriNetUnfolder]: 4/26 cut-off events. [2021-03-26 16:08:43,383 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 16:08:43,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2021-03-26 16:08:43,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 29 transitions, 82 flow [2021-03-26 16:08:43,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 24 transitions, 66 flow [2021-03-26 16:08:43,390 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:43,402 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 66 flow [2021-03-26 16:08:43,404 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 66 flow [2021-03-26 16:08:43,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 66 flow [2021-03-26 16:08:43,413 INFO L129 PetriNetUnfolder]: 4/24 cut-off events. [2021-03-26 16:08:43,413 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 16:08:43,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 4/24 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2021-03-26 16:08:43,415 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-26 16:08:43,592 INFO L154 LiptonReduction]: Checked pairs total: 90 [2021-03-26 16:08:43,592 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 16:08:43,594 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 205 [2021-03-26 16:08:43,605 INFO L129 PetriNetUnfolder]: 4/16 cut-off events. [2021-03-26 16:08:43,605 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 16:08:43,606 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:43,606 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:43,606 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1603213337, now seen corresponding path program 1 times [2021-03-26 16:08:43,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:43,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113734443] [2021-03-26 16:08:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:43,790 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.7 percent of original size [2021-03-26 16:08:43,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:08:43,842 INFO L142 QuantifierPusher]: treesize reduction 13, result has 76.4 percent of original size [2021-03-26 16:08:43,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 16:08:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:43,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113734443] [2021-03-26 16:08:43,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 16:08:43,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 16:08:43,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585563966] [2021-03-26 16:08:43,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 16:08:43,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:43,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 16:08:43,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 16:08:43,919 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2021-03-26 16:08:43,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:43,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:43,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2021-03-26 16:08:43,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:44,043 INFO L129 PetriNetUnfolder]: 104/163 cut-off events. [2021-03-26 16:08:44,044 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-26 16:08:44,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 163 events. 104/163 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 479 event pairs, 26 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 312. Up to 93 conditions per place. [2021-03-26 16:08:44,051 INFO L132 encePairwiseOnDemand]: 31/36 looper letters, 18 selfloop transitions, 5 changer transitions 1/30 dead transitions. [2021-03-26 16:08:44,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 30 transitions, 126 flow [2021-03-26 16:08:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 16:08:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 16:08:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2021-03-26 16:08:44,063 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2021-03-26 16:08:44,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 85 transitions. [2021-03-26 16:08:44,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 85 transitions. [2021-03-26 16:08:44,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:44,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 85 transitions. [2021-03-26 16:08:44,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,080 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,081 INFO L185 Difference]: Start difference. First operand has 23 places, 17 transitions, 52 flow. Second operand 4 states and 85 transitions. [2021-03-26 16:08:44,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 30 transitions, 126 flow [2021-03-26 16:08:44,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-26 16:08:44,092 INFO L241 Difference]: Finished difference. Result has 22 places, 21 transitions, 72 flow [2021-03-26 16:08:44,094 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2021-03-26 16:08:44,095 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2021-03-26 16:08:44,095 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:44,095 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 21 transitions, 72 flow [2021-03-26 16:08:44,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 21 transitions, 72 flow [2021-03-26 16:08:44,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 22 places, 21 transitions, 72 flow [2021-03-26 16:08:44,111 INFO L129 PetriNetUnfolder]: 10/35 cut-off events. [2021-03-26 16:08:44,112 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 16:08:44,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 35 events. 10/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 40. Up to 8 conditions per place. [2021-03-26 16:08:44,113 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-26 16:08:44,116 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:44,116 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:44,116 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 16:08:44,118 INFO L480 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 72 flow [2021-03-26 16:08:44,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,119 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:44,119 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:44,119 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 16:08:44,119 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2064833924, now seen corresponding path program 1 times [2021-03-26 16:08:44,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:44,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187803689] [2021-03-26 16:08:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:44,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:44,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:44,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:44,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187803689] [2021-03-26 16:08:44,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 16:08:44,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 16:08:44,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663117626] [2021-03-26 16:08:44,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 16:08:44,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 16:08:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 16:08:44,181 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2021-03-26 16:08:44,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:44,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2021-03-26 16:08:44,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:44,268 INFO L129 PetriNetUnfolder]: 104/175 cut-off events. [2021-03-26 16:08:44,269 INFO L130 PetriNetUnfolder]: For 46/51 co-relation queries the response was YES. [2021-03-26 16:08:44,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 175 events. 104/175 cut-off events. For 46/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 528 event pairs, 12 based on Foata normal form. 21/155 useless extension candidates. Maximal degree in co-relation 369. Up to 79 conditions per place. [2021-03-26 16:08:44,278 INFO L132 encePairwiseOnDemand]: 30/36 looper letters, 23 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-03-26 16:08:44,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 37 transitions, 173 flow [2021-03-26 16:08:44,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 16:08:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 16:08:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2021-03-26 16:08:44,287 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6 [2021-03-26 16:08:44,287 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 108 transitions. [2021-03-26 16:08:44,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 108 transitions. [2021-03-26 16:08:44,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:44,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 108 transitions. [2021-03-26 16:08:44,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,290 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,291 INFO L185 Difference]: Start difference. First operand has 22 places, 21 transitions, 72 flow. Second operand 5 states and 108 transitions. [2021-03-26 16:08:44,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 37 transitions, 173 flow [2021-03-26 16:08:44,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 16:08:44,293 INFO L241 Difference]: Finished difference. Result has 30 places, 24 transitions, 123 flow [2021-03-26 16:08:44,293 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2021-03-26 16:08:44,293 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 7 predicate places. [2021-03-26 16:08:44,294 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:44,294 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 123 flow [2021-03-26 16:08:44,294 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 123 flow [2021-03-26 16:08:44,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 123 flow [2021-03-26 16:08:44,304 INFO L129 PetriNetUnfolder]: 12/52 cut-off events. [2021-03-26 16:08:44,304 INFO L130 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2021-03-26 16:08:44,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 52 events. 12/52 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 163 event pairs, 2 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 90. Up to 12 conditions per place. [2021-03-26 16:08:44,305 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-26 16:08:44,309 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:44,309 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:44,309 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 16:08:44,310 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 123 flow [2021-03-26 16:08:44,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,311 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:44,311 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:44,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 16:08:44,311 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -452810530, now seen corresponding path program 2 times [2021-03-26 16:08:44,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:44,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127790096] [2021-03-26 16:08:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:44,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:44,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:44,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:44,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127790096] [2021-03-26 16:08:44,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 16:08:44,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 16:08:44,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637994069] [2021-03-26 16:08:44,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 16:08:44,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:44,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 16:08:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 16:08:44,400 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2021-03-26 16:08:44,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:44,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2021-03-26 16:08:44,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:44,468 INFO L129 PetriNetUnfolder]: 90/155 cut-off events. [2021-03-26 16:08:44,469 INFO L130 PetriNetUnfolder]: For 188/205 co-relation queries the response was YES. [2021-03-26 16:08:44,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 155 events. 90/155 cut-off events. For 188/205 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 436 event pairs, 4 based on Foata normal form. 12/137 useless extension candidates. Maximal degree in co-relation 395. Up to 53 conditions per place. [2021-03-26 16:08:44,471 INFO L132 encePairwiseOnDemand]: 30/36 looper letters, 24 selfloop transitions, 5 changer transitions 6/41 dead transitions. [2021-03-26 16:08:44,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 252 flow [2021-03-26 16:08:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 16:08:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 16:08:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2021-03-26 16:08:44,477 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6 [2021-03-26 16:08:44,477 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 108 transitions. [2021-03-26 16:08:44,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 108 transitions. [2021-03-26 16:08:44,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:44,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 108 transitions. [2021-03-26 16:08:44,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,481 INFO L185 Difference]: Start difference. First operand has 30 places, 24 transitions, 123 flow. Second operand 5 states and 108 transitions. [2021-03-26 16:08:44,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 252 flow [2021-03-26 16:08:44,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 246 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-26 16:08:44,485 INFO L241 Difference]: Finished difference. Result has 35 places, 22 transitions, 114 flow [2021-03-26 16:08:44,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2021-03-26 16:08:44,485 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2021-03-26 16:08:44,485 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:44,485 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 114 flow [2021-03-26 16:08:44,486 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 114 flow [2021-03-26 16:08:44,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 114 flow [2021-03-26 16:08:44,489 INFO L129 PetriNetUnfolder]: 8/31 cut-off events. [2021-03-26 16:08:44,489 INFO L130 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2021-03-26 16:08:44,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 31 events. 8/31 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 73. Up to 7 conditions per place. [2021-03-26 16:08:44,490 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-26 16:08:44,492 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:44,492 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:44,492 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-26 16:08:44,497 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 114 flow [2021-03-26 16:08:44,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,497 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:44,497 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:44,497 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 16:08:44,497 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash 99223701, now seen corresponding path program 1 times [2021-03-26 16:08:44,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:44,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220754868] [2021-03-26 16:08:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:44,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:44,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:44,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220754868] [2021-03-26 16:08:44,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 16:08:44,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 16:08:44,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722363453] [2021-03-26 16:08:44,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 16:08:44,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:44,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 16:08:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 16:08:44,531 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 36 [2021-03-26 16:08:44,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:44,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 36 [2021-03-26 16:08:44,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:44,551 INFO L129 PetriNetUnfolder]: 23/52 cut-off events. [2021-03-26 16:08:44,553 INFO L130 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2021-03-26 16:08:44,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 52 events. 23/52 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 2/51 useless extension candidates. Maximal degree in co-relation 139. Up to 27 conditions per place. [2021-03-26 16:08:44,555 INFO L132 encePairwiseOnDemand]: 33/36 looper letters, 12 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-03-26 16:08:44,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 160 flow [2021-03-26 16:08:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 16:08:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 16:08:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2021-03-26 16:08:44,557 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7962962962962963 [2021-03-26 16:08:44,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2021-03-26 16:08:44,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2021-03-26 16:08:44,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:44,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2021-03-26 16:08:44,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,560 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 114 flow. Second operand 3 states and 86 transitions. [2021-03-26 16:08:44,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 160 flow [2021-03-26 16:08:44,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 140 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-03-26 16:08:44,563 INFO L241 Difference]: Finished difference. Result has 31 places, 23 transitions, 109 flow [2021-03-26 16:08:44,564 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2021-03-26 16:08:44,564 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 8 predicate places. [2021-03-26 16:08:44,564 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:44,564 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 109 flow [2021-03-26 16:08:44,564 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 23 transitions, 109 flow [2021-03-26 16:08:44,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 23 transitions, 109 flow [2021-03-26 16:08:44,568 INFO L129 PetriNetUnfolder]: 11/38 cut-off events. [2021-03-26 16:08:44,569 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 16:08:44,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 38 events. 11/38 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 71. Up to 8 conditions per place. [2021-03-26 16:08:44,569 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-26 16:08:44,571 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:44,571 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:44,571 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-26 16:08:44,572 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 109 flow [2021-03-26 16:08:44,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,572 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:44,573 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:44,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 16:08:44,573 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2029596539, now seen corresponding path program 1 times [2021-03-26 16:08:44,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:44,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797100092] [2021-03-26 16:08:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:44,618 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-26 16:08:44,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:44,628 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-26 16:08:44,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:44,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:44,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:44,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797100092] [2021-03-26 16:08:44,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 16:08:44,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 16:08:44,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775351808] [2021-03-26 16:08:44,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 16:08:44,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:44,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 16:08:44,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 16:08:44,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2021-03-26 16:08:44,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:44,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2021-03-26 16:08:44,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:44,721 INFO L129 PetriNetUnfolder]: 127/198 cut-off events. [2021-03-26 16:08:44,721 INFO L130 PetriNetUnfolder]: For 143/153 co-relation queries the response was YES. [2021-03-26 16:08:44,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 198 events. 127/198 cut-off events. For 143/153 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 533 event pairs, 38 based on Foata normal form. 18/213 useless extension candidates. Maximal degree in co-relation 611. Up to 138 conditions per place. [2021-03-26 16:08:44,723 INFO L132 encePairwiseOnDemand]: 29/36 looper letters, 28 selfloop transitions, 10 changer transitions 1/45 dead transitions. [2021-03-26 16:08:44,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 285 flow [2021-03-26 16:08:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 16:08:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 16:08:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2021-03-26 16:08:44,724 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2021-03-26 16:08:44,724 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 120 transitions. [2021-03-26 16:08:44,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 120 transitions. [2021-03-26 16:08:44,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:44,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 120 transitions. [2021-03-26 16:08:44,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,727 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,727 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 109 flow. Second operand 6 states and 120 transitions. [2021-03-26 16:08:44,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 285 flow [2021-03-26 16:08:44,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 16:08:44,731 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 178 flow [2021-03-26 16:08:44,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2021-03-26 16:08:44,731 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 15 predicate places. [2021-03-26 16:08:44,731 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:44,731 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 178 flow [2021-03-26 16:08:44,731 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 178 flow [2021-03-26 16:08:44,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 178 flow [2021-03-26 16:08:44,737 INFO L129 PetriNetUnfolder]: 20/59 cut-off events. [2021-03-26 16:08:44,738 INFO L130 PetriNetUnfolder]: For 31/34 co-relation queries the response was YES. [2021-03-26 16:08:44,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 59 events. 20/59 cut-off events. For 31/34 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 161 event pairs, 1 based on Foata normal form. 2/59 useless extension candidates. Maximal degree in co-relation 147. Up to 15 conditions per place. [2021-03-26 16:08:44,739 INFO L142 LiptonReduction]: Number of co-enabled transitions 162 [2021-03-26 16:08:44,742 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:44,742 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:44,742 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-26 16:08:44,744 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 178 flow [2021-03-26 16:08:44,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:44,744 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:44,744 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:44,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 16:08:44,744 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash -325290422, now seen corresponding path program 1 times [2021-03-26 16:08:44,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:44,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732559269] [2021-03-26 16:08:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:44,801 INFO L142 QuantifierPusher]: treesize reduction 4, result has 76.5 percent of original size [2021-03-26 16:08:44,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:44,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:44,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:44,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:44,850 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:08:44,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:44,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732559269] [2021-03-26 16:08:44,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608672653] [2021-03-26 16:08:44,868 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-03-26 16:08:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:44,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-26 16:08:44,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:44,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:44,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:44,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:44,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:44,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:44,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:44,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:44,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,067 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.0 percent of original size [2021-03-26 16:08:45,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:45,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:45,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:45,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 16:08:45,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,114 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:45,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:45,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:08:45,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:45,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:45,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:45,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,123 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:45,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:45,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:45,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:45,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:45,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:08:45,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:45,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:45,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:45,173 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,176 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 15 treesize of output 11 [2021-03-26 16:08:45,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:45,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:45,179 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:45,188 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,190 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:45,190 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2021-03-26 16:08:45,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:45,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,249 INFO L147 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size 19 [2021-03-26 16:08:45,250 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-26 16:08:45,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:45,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:45,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:45,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:45,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:45,258 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-03-26 16:08:45,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:45,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:45,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:45,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,266 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:45,266 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-26 16:08:45,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:45,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:45,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2021-03-26 16:08:45,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333207446] [2021-03-26 16:08:45,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 16:08:45,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:45,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 16:08:45,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-26 16:08:45,304 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2021-03-26 16:08:45,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 178 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:45,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:45,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2021-03-26 16:08:45,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:45,527 INFO L129 PetriNetUnfolder]: 173/289 cut-off events. [2021-03-26 16:08:45,528 INFO L130 PetriNetUnfolder]: For 388/405 co-relation queries the response was YES. [2021-03-26 16:08:45,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 289 events. 173/289 cut-off events. For 388/405 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1017 event pairs, 24 based on Foata normal form. 16/304 useless extension candidates. Maximal degree in co-relation 968. Up to 190 conditions per place. [2021-03-26 16:08:45,531 INFO L132 encePairwiseOnDemand]: 29/36 looper letters, 34 selfloop transitions, 12 changer transitions 2/54 dead transitions. [2021-03-26 16:08:45,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 390 flow [2021-03-26 16:08:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 16:08:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 16:08:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2021-03-26 16:08:45,532 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2021-03-26 16:08:45,532 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 138 transitions. [2021-03-26 16:08:45,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 138 transitions. [2021-03-26 16:08:45,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:45,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 138 transitions. [2021-03-26 16:08:45,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:45,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:45,534 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:45,534 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 178 flow. Second operand 7 states and 138 transitions. [2021-03-26 16:08:45,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 390 flow [2021-03-26 16:08:45,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 384 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-26 16:08:45,537 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 264 flow [2021-03-26 16:08:45,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=264, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-26 16:08:45,540 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 25 predicate places. [2021-03-26 16:08:45,540 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:45,540 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 264 flow [2021-03-26 16:08:45,540 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 264 flow [2021-03-26 16:08:45,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 264 flow [2021-03-26 16:08:45,554 INFO L129 PetriNetUnfolder]: 42/123 cut-off events. [2021-03-26 16:08:45,554 INFO L130 PetriNetUnfolder]: For 156/158 co-relation queries the response was YES. [2021-03-26 16:08:45,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 123 events. 42/123 cut-off events. For 156/158 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 521 event pairs, 6 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 377. Up to 37 conditions per place. [2021-03-26 16:08:45,557 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-26 16:08:45,560 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:45,560 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:45,560 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 16:08:45,561 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 264 flow [2021-03-26 16:08:45,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:45,561 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:45,562 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:45,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-03-26 16:08:45,776 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:45,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:45,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1752726740, now seen corresponding path program 2 times [2021-03-26 16:08:45,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:45,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002646117] [2021-03-26 16:08:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:45,813 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 16:08:45,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:45,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:45,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:45,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:45,874 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:08:45,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:45,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002646117] [2021-03-26 16:08:45,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238446218] [2021-03-26 16:08:45,885 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 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-03-26 16:08:45,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-26 16:08:45,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:08:45,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-26 16:08:45,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:45,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:45,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:45,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:45,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:45,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:45,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:45,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:45,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:45,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:46,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:46,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:46,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:08:46,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 16:08:46,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:46,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:46,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:08:46,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 16:08:46,044 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 18 treesize of output 14 [2021-03-26 16:08:46,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:46,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:46,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:46,058 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2021-03-26 16:08:46,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:46,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:46,062 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:46,070 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,071 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.0 percent of original size [2021-03-26 16:08:46,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,072 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:46,072 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2021-03-26 16:08:46,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,100 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.4 percent of original size [2021-03-26 16:08:46,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:46,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:46,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:08:46,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:46,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:46,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:46,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:46,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,149 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-03-26 16:08:46,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:46,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:46,151 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:46,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,157 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:46,157 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-26 16:08:46,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:46,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:46,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2021-03-26 16:08:46,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080783512] [2021-03-26 16:08:46,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 16:08:46,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 16:08:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-03-26 16:08:46,198 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2021-03-26 16:08:46,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 264 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:46,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:46,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2021-03-26 16:08:46,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:46,459 INFO L129 PetriNetUnfolder]: 231/397 cut-off events. [2021-03-26 16:08:46,459 INFO L130 PetriNetUnfolder]: For 992/1003 co-relation queries the response was YES. [2021-03-26 16:08:46,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 397 events. 231/397 cut-off events. For 992/1003 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1578 event pairs, 37 based on Foata normal form. 7/403 useless extension candidates. Maximal degree in co-relation 1563. Up to 234 conditions per place. [2021-03-26 16:08:46,463 INFO L132 encePairwiseOnDemand]: 29/36 looper letters, 40 selfloop transitions, 22 changer transitions 1/69 dead transitions. [2021-03-26 16:08:46,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 595 flow [2021-03-26 16:08:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 16:08:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 16:08:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2021-03-26 16:08:46,464 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2021-03-26 16:08:46,464 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 145 transitions. [2021-03-26 16:08:46,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 145 transitions. [2021-03-26 16:08:46,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:46,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 145 transitions. [2021-03-26 16:08:46,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:46,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:46,465 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:46,465 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 264 flow. Second operand 7 states and 145 transitions. [2021-03-26 16:08:46,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 595 flow [2021-03-26 16:08:46,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 578 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-26 16:08:46,470 INFO L241 Difference]: Finished difference. Result has 56 places, 48 transitions, 422 flow [2021-03-26 16:08:46,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=422, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2021-03-26 16:08:46,470 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 33 predicate places. [2021-03-26 16:08:46,470 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:46,470 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 48 transitions, 422 flow [2021-03-26 16:08:46,471 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 422 flow [2021-03-26 16:08:46,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 422 flow [2021-03-26 16:08:46,482 INFO L129 PetriNetUnfolder]: 58/153 cut-off events. [2021-03-26 16:08:46,482 INFO L130 PetriNetUnfolder]: For 413/428 co-relation queries the response was YES. [2021-03-26 16:08:46,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 153 events. 58/153 cut-off events. For 413/428 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 626 event pairs, 4 based on Foata normal form. 2/149 useless extension candidates. Maximal degree in co-relation 546. Up to 42 conditions per place. [2021-03-26 16:08:46,485 INFO L142 LiptonReduction]: Number of co-enabled transitions 284 [2021-03-26 16:08:46,526 INFO L154 LiptonReduction]: Checked pairs total: 12 [2021-03-26 16:08:46,526 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 16:08:46,526 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-26 16:08:46,527 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 424 flow [2021-03-26 16:08:46,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:46,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:46,527 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:46,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:46,745 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:46,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1035774060, now seen corresponding path program 3 times [2021-03-26 16:08:46,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:46,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236452332] [2021-03-26 16:08:46,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:46,795 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 16:08:46,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:46,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:46,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:46,824 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-26 16:08:46,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:08:46,838 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:08:46,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:46,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236452332] [2021-03-26 16:08:46,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127336434] [2021-03-26 16:08:46,849 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 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-03-26 16:08:46,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-26 16:08:46,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:08:46,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-26 16:08:46,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:46,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:46,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:46,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:08:46,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,956 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:46,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:46,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:46,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:46,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:46,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:46,968 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 16 treesize of output 12 [2021-03-26 16:08:46,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:46,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:46,971 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:46,980 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-03-26 16:08:46,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:46,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:46,985 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:46,994 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:46,995 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:46,995 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2021-03-26 16:08:46,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:46,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:46,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:47,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:47,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:47,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:47,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:47,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:47,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:47,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:47,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:47,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,024 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:47,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:47,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:47,029 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-03-26 16:08:47,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:47,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:47,031 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:47,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,038 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:47,038 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-26 16:08:47,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,059 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-26 16:08:47,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:47,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,061 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:47,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:47,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:47,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:47,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:47,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2021-03-26 16:08:47,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388686758] [2021-03-26 16:08:47,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 16:08:47,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:47,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 16:08:47,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-26 16:08:47,098 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2021-03-26 16:08:47,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 424 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:47,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:47,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2021-03-26 16:08:47,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:47,451 INFO L129 PetriNetUnfolder]: 322/560 cut-off events. [2021-03-26 16:08:47,451 INFO L130 PetriNetUnfolder]: For 2204/2215 co-relation queries the response was YES. [2021-03-26 16:08:47,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 560 events. 322/560 cut-off events. For 2204/2215 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2445 event pairs, 41 based on Foata normal form. 12/572 useless extension candidates. Maximal degree in co-relation 2516. Up to 240 conditions per place. [2021-03-26 16:08:47,457 INFO L132 encePairwiseOnDemand]: 28/37 looper letters, 50 selfloop transitions, 35 changer transitions 1/92 dead transitions. [2021-03-26 16:08:47,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 920 flow [2021-03-26 16:08:47,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 16:08:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 16:08:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2021-03-26 16:08:47,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2021-03-26 16:08:47,458 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 186 transitions. [2021-03-26 16:08:47,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 186 transitions. [2021-03-26 16:08:47,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:47,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 186 transitions. [2021-03-26 16:08:47,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:47,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:47,460 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:47,460 INFO L185 Difference]: Start difference. First operand has 56 places, 48 transitions, 424 flow. Second operand 9 states and 186 transitions. [2021-03-26 16:08:47,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 920 flow [2021-03-26 16:08:47,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 884 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-03-26 16:08:47,468 INFO L241 Difference]: Finished difference. Result has 67 places, 62 transitions, 651 flow [2021-03-26 16:08:47,469 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=651, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2021-03-26 16:08:47,469 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 44 predicate places. [2021-03-26 16:08:47,469 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:47,469 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 62 transitions, 651 flow [2021-03-26 16:08:47,469 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 651 flow [2021-03-26 16:08:47,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 62 transitions, 651 flow [2021-03-26 16:08:47,490 INFO L129 PetriNetUnfolder]: 103/253 cut-off events. [2021-03-26 16:08:47,490 INFO L130 PetriNetUnfolder]: For 1320/1373 co-relation queries the response was YES. [2021-03-26 16:08:47,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 253 events. 103/253 cut-off events. For 1320/1373 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1214 event pairs, 10 based on Foata normal form. 6/246 useless extension candidates. Maximal degree in co-relation 1136. Up to 91 conditions per place. [2021-03-26 16:08:47,494 INFO L142 LiptonReduction]: Number of co-enabled transitions 380 [2021-03-26 16:08:47,613 INFO L154 LiptonReduction]: Checked pairs total: 72 [2021-03-26 16:08:47,613 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 16:08:47,613 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-26 16:08:47,614 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 659 flow [2021-03-26 16:08:47,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:47,614 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:47,614 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:47,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:47,836 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1764702536, now seen corresponding path program 4 times [2021-03-26 16:08:47,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:47,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710278009] [2021-03-26 16:08:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:47,862 INFO L142 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size [2021-03-26 16:08:47,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:47,880 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.0 percent of original size [2021-03-26 16:08:47,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:08:47,892 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.0 percent of original size [2021-03-26 16:08:47,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:08:47,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:47,915 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:08:47,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:47,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710278009] [2021-03-26 16:08:47,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553714586] [2021-03-26 16:08:47,924 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 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-03-26 16:08:47,951 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-26 16:08:47,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:08:47,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-26 16:08:47,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:47,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:47,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:47,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:47,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:47,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,967 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:47,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:47,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:47,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:47,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:47,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:47,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:08:47,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:47,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:47,976 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:47,985 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:47,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:47,986 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-03-26 16:08:47,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:47,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:47,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,014 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-26 16:08:48,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:48,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:48,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:08:48,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:48,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,043 INFO L147 QuantifierPusher]: treesize reduction 2, result has 93.9 percent of original size 31 [2021-03-26 16:08:48,044 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.1 percent of original size [2021-03-26 16:08:48,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:48,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:48,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:48,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:48,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-26 16:08:48,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:48,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:48,064 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:48,070 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,070 INFO L142 QuantifierPusher]: treesize reduction -1, result has 104.3 percent of original size [2021-03-26 16:08:48,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,071 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:48,071 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:24 [2021-03-26 16:08:48,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:08:48,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:48,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:48,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:48,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:48,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:48,105 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-03-26 16:08:48,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:48,110 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:48,111 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-26 16:08:48,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:48,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:48,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-26 16:08:48,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768751746] [2021-03-26 16:08:48,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 16:08:48,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:48,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 16:08:48,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-26 16:08:48,131 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2021-03-26 16:08:48,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 659 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:48,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:48,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2021-03-26 16:08:48,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:48,336 INFO L129 PetriNetUnfolder]: 359/612 cut-off events. [2021-03-26 16:08:48,336 INFO L130 PetriNetUnfolder]: For 4090/4096 co-relation queries the response was YES. [2021-03-26 16:08:48,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 612 events. 359/612 cut-off events. For 4090/4096 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2770 event pairs, 93 based on Foata normal form. 7/619 useless extension candidates. Maximal degree in co-relation 3299. Up to 506 conditions per place. [2021-03-26 16:08:48,343 INFO L132 encePairwiseOnDemand]: 35/41 looper letters, 71 selfloop transitions, 17 changer transitions 0/94 dead transitions. [2021-03-26 16:08:48,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 1075 flow [2021-03-26 16:08:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 16:08:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 16:08:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2021-03-26 16:08:48,344 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5017421602787456 [2021-03-26 16:08:48,344 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 144 transitions. [2021-03-26 16:08:48,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 144 transitions. [2021-03-26 16:08:48,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:48,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 144 transitions. [2021-03-26 16:08:48,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:48,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 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-03-26 16:08:48,346 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 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-03-26 16:08:48,346 INFO L185 Difference]: Start difference. First operand has 66 places, 62 transitions, 659 flow. Second operand 7 states and 144 transitions. [2021-03-26 16:08:48,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 1075 flow [2021-03-26 16:08:48,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 1002 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 16:08:48,357 INFO L241 Difference]: Finished difference. Result has 70 places, 74 transitions, 776 flow [2021-03-26 16:08:48,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=776, PETRI_PLACES=70, PETRI_TRANSITIONS=74} [2021-03-26 16:08:48,357 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 47 predicate places. [2021-03-26 16:08:48,358 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:48,358 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 74 transitions, 776 flow [2021-03-26 16:08:48,358 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 74 transitions, 776 flow [2021-03-26 16:08:48,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 74 transitions, 776 flow [2021-03-26 16:08:48,379 INFO L129 PetriNetUnfolder]: 103/256 cut-off events. [2021-03-26 16:08:48,379 INFO L130 PetriNetUnfolder]: For 1378/1433 co-relation queries the response was YES. [2021-03-26 16:08:48,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 256 events. 103/256 cut-off events. For 1378/1433 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1267 event pairs, 11 based on Foata normal form. 4/254 useless extension candidates. Maximal degree in co-relation 1185. Up to 85 conditions per place. [2021-03-26 16:08:48,384 INFO L142 LiptonReduction]: Number of co-enabled transitions 444 [2021-03-26 16:08:48,546 INFO L154 LiptonReduction]: Checked pairs total: 161 [2021-03-26 16:08:48,546 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 16:08:48,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 188 [2021-03-26 16:08:48,546 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 790 flow [2021-03-26 16:08:48,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:48,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:48,547 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:48,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:48,760 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash 388538190, now seen corresponding path program 1 times [2021-03-26 16:08:48,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:48,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069267120] [2021-03-26 16:08:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:48,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:48,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:48,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069267120] [2021-03-26 16:08:48,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647557886] [2021-03-26 16:08:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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) [2021-03-26 16:08:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:48,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 16:08:48,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:48,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,836 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:48,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:48,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:48,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:48,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:48,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:48,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:48,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:48,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:48,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:48,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:48,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:48,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:48,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:48,871 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-26 16:08:48,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:48,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 16:08:48,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:48,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-26 16:08:48,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590974334] [2021-03-26 16:08:48,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 16:08:48,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:48,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 16:08:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 16:08:48,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 48 [2021-03-26 16:08:48,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 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-03-26 16:08:48,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:48,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 48 [2021-03-26 16:08:48,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:48,979 INFO L129 PetriNetUnfolder]: 300/582 cut-off events. [2021-03-26 16:08:48,979 INFO L130 PetriNetUnfolder]: For 3725/3791 co-relation queries the response was YES. [2021-03-26 16:08:48,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 582 events. 300/582 cut-off events. For 3725/3791 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3000 event pairs, 37 based on Foata normal form. 24/594 useless extension candidates. Maximal degree in co-relation 2853. Up to 217 conditions per place. [2021-03-26 16:08:48,986 INFO L132 encePairwiseOnDemand]: 44/48 looper letters, 42 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2021-03-26 16:08:48,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 1072 flow [2021-03-26 16:08:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 16:08:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 16:08:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2021-03-26 16:08:48,988 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2021-03-26 16:08:48,988 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 170 transitions. [2021-03-26 16:08:48,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 170 transitions. [2021-03-26 16:08:48,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:48,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 170 transitions. [2021-03-26 16:08:48,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:48,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:48,989 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:48,989 INFO L185 Difference]: Start difference. First operand has 70 places, 74 transitions, 790 flow. Second operand 5 states and 170 transitions. [2021-03-26 16:08:48,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 1072 flow [2021-03-26 16:08:49,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 1022 flow, removed 21 selfloop flow, removed 2 redundant places. [2021-03-26 16:08:49,002 INFO L241 Difference]: Finished difference. Result has 74 places, 77 transitions, 855 flow [2021-03-26 16:08:49,002 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=855, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2021-03-26 16:08:49,003 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 51 predicate places. [2021-03-26 16:08:49,003 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:49,003 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 77 transitions, 855 flow [2021-03-26 16:08:49,003 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 77 transitions, 855 flow [2021-03-26 16:08:49,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 77 transitions, 855 flow [2021-03-26 16:08:49,047 INFO L129 PetriNetUnfolder]: 130/324 cut-off events. [2021-03-26 16:08:49,047 INFO L130 PetriNetUnfolder]: For 2228/2376 co-relation queries the response was YES. [2021-03-26 16:08:49,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 324 events. 130/324 cut-off events. For 2228/2376 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1758 event pairs, 12 based on Foata normal form. 6/314 useless extension candidates. Maximal degree in co-relation 1587. Up to 106 conditions per place. [2021-03-26 16:08:49,052 INFO L142 LiptonReduction]: Number of co-enabled transitions 484 [2021-03-26 16:08:49,094 INFO L154 LiptonReduction]: Checked pairs total: 24 [2021-03-26 16:08:49,094 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 16:08:49,094 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 91 [2021-03-26 16:08:49,095 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 857 flow [2021-03-26 16:08:49,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 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-03-26 16:08:49,095 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:49,095 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:49,303 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-03-26 16:08:49,304 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1290588240, now seen corresponding path program 1 times [2021-03-26 16:08:49,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:49,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893865796] [2021-03-26 16:08:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:49,334 INFO L142 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size [2021-03-26 16:08:49,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,345 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-26 16:08:49,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:49,356 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-26 16:08:49,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:49,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:49,375 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:08:49,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:49,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893865796] [2021-03-26 16:08:49,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053774287] [2021-03-26 16:08:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-03-26 16:08:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:49,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-26 16:08:49,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:49,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:49,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:49,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:49,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:49,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:49,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:49,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:49,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:49,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:49,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:49,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:08:49,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:49,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:49,432 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:49,442 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,443 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:49,443 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-03-26 16:08:49,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,462 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-26 16:08:49,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:49,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,464 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:49,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:49,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:08:49,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:49,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:08:49,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,495 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:49,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:49,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:49,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,499 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:49,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:49,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:49,504 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 17 treesize of output 13 [2021-03-26 16:08:49,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:49,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:49,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:49,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:49,514 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:49,514 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2021-03-26 16:08:49,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:49,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:49,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:49,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:49,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:49,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:49,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:49,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,536 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:49,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:49,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:49,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,538 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:49,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:49,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:49,542 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-03-26 16:08:49,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:49,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:49,543 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:49,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,549 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:49,549 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-26 16:08:49,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:49,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:49,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:49,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-26 16:08:49,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361107015] [2021-03-26 16:08:49,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 16:08:49,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:49,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 16:08:49,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-26 16:08:49,574 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2021-03-26 16:08:49,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 857 flow. Second operand has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:49,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:49,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2021-03-26 16:08:49,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:49,834 INFO L129 PetriNetUnfolder]: 469/824 cut-off events. [2021-03-26 16:08:49,834 INFO L130 PetriNetUnfolder]: For 6722/6733 co-relation queries the response was YES. [2021-03-26 16:08:49,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 824 events. 469/824 cut-off events. For 6722/6733 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4122 event pairs, 143 based on Foata normal form. 10/834 useless extension candidates. Maximal degree in co-relation 4504. Up to 692 conditions per place. [2021-03-26 16:08:49,842 INFO L132 encePairwiseOnDemand]: 42/49 looper letters, 79 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2021-03-26 16:08:49,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 102 transitions, 1198 flow [2021-03-26 16:08:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 16:08:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 16:08:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2021-03-26 16:08:49,843 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4402332361516035 [2021-03-26 16:08:49,843 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 151 transitions. [2021-03-26 16:08:49,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 151 transitions. [2021-03-26 16:08:49,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:49,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 151 transitions. [2021-03-26 16:08:49,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:49,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:49,845 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:49,845 INFO L185 Difference]: Start difference. First operand has 74 places, 77 transitions, 857 flow. Second operand 7 states and 151 transitions. [2021-03-26 16:08:49,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 102 transitions, 1198 flow [2021-03-26 16:08:49,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 102 transitions, 1164 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 16:08:49,858 INFO L241 Difference]: Finished difference. Result has 79 places, 81 transitions, 912 flow [2021-03-26 16:08:49,858 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=912, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2021-03-26 16:08:49,858 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 56 predicate places. [2021-03-26 16:08:49,858 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:49,858 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 81 transitions, 912 flow [2021-03-26 16:08:49,859 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 81 transitions, 912 flow [2021-03-26 16:08:49,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 81 transitions, 912 flow [2021-03-26 16:08:49,885 INFO L129 PetriNetUnfolder]: 143/365 cut-off events. [2021-03-26 16:08:49,885 INFO L130 PetriNetUnfolder]: For 2071/2167 co-relation queries the response was YES. [2021-03-26 16:08:49,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 365 events. 143/365 cut-off events. For 2071/2167 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2068 event pairs, 12 based on Foata normal form. 4/353 useless extension candidates. Maximal degree in co-relation 1699. Up to 113 conditions per place. [2021-03-26 16:08:49,891 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-26 16:08:49,999 INFO L154 LiptonReduction]: Checked pairs total: 57 [2021-03-26 16:08:50,000 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 16:08:50,000 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 142 [2021-03-26 16:08:50,001 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 918 flow [2021-03-26 16:08:50,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:50,001 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:50,002 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:50,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:50,223 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:50,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:50,223 INFO L82 PathProgramCache]: Analyzing trace with hash -617975518, now seen corresponding path program 1 times [2021-03-26 16:08:50,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:50,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532101440] [2021-03-26 16:08:50,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:50,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:50,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:50,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532101440] [2021-03-26 16:08:50,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775440076] [2021-03-26 16:08:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-03-26 16:08:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:50,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 16:08:50,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:50,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,303 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:50,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:50,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,305 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:50,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:50,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:50,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:50,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:50,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:50,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,325 INFO L142 QuantifierPusher]: treesize reduction 1, result has 87.5 percent of original size [2021-03-26 16:08:50,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:50,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:50,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:50,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,334 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-26 16:08:50,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:50,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:50,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-26 16:08:50,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231863376] [2021-03-26 16:08:50,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 16:08:50,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:50,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 16:08:50,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 16:08:50,344 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-03-26 16:08:50,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 918 flow. Second operand has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:50,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:50,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-03-26 16:08:50,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:50,460 INFO L129 PetriNetUnfolder]: 317/634 cut-off events. [2021-03-26 16:08:50,461 INFO L130 PetriNetUnfolder]: For 3812/3909 co-relation queries the response was YES. [2021-03-26 16:08:50,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3225 conditions, 634 events. 317/634 cut-off events. For 3812/3909 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3465 event pairs, 30 based on Foata normal form. 32/650 useless extension candidates. Maximal degree in co-relation 3094. Up to 198 conditions per place. [2021-03-26 16:08:50,493 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 53 selfloop transitions, 28 changer transitions 0/111 dead transitions. [2021-03-26 16:08:50,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 111 transitions, 1341 flow [2021-03-26 16:08:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 16:08:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 16:08:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 293 transitions. [2021-03-26 16:08:50,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7043269230769231 [2021-03-26 16:08:50,495 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 293 transitions. [2021-03-26 16:08:50,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 293 transitions. [2021-03-26 16:08:50,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:50,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 293 transitions. [2021-03-26 16:08:50,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:50,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:50,497 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:50,497 INFO L185 Difference]: Start difference. First operand has 79 places, 81 transitions, 918 flow. Second operand 8 states and 293 transitions. [2021-03-26 16:08:50,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 111 transitions, 1341 flow [2021-03-26 16:08:50,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 111 transitions, 1299 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-26 16:08:50,507 INFO L241 Difference]: Finished difference. Result has 85 places, 90 transitions, 1063 flow [2021-03-26 16:08:50,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1063, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2021-03-26 16:08:50,508 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 62 predicate places. [2021-03-26 16:08:50,508 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:50,508 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 90 transitions, 1063 flow [2021-03-26 16:08:50,508 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 90 transitions, 1063 flow [2021-03-26 16:08:50,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 90 transitions, 1063 flow [2021-03-26 16:08:50,535 INFO L129 PetriNetUnfolder]: 134/347 cut-off events. [2021-03-26 16:08:50,535 INFO L130 PetriNetUnfolder]: For 2657/2827 co-relation queries the response was YES. [2021-03-26 16:08:50,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 347 events. 134/347 cut-off events. For 2657/2827 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1974 event pairs, 11 based on Foata normal form. 9/352 useless extension candidates. Maximal degree in co-relation 1731. Up to 113 conditions per place. [2021-03-26 16:08:50,540 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-26 16:08:50,553 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:50,553 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:50,553 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-03-26 16:08:50,554 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 1063 flow [2021-03-26 16:08:50,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:50,554 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:50,554 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:50,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:50,775 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:50,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1417895755, now seen corresponding path program 1 times [2021-03-26 16:08:50,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:50,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841032536] [2021-03-26 16:08:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:50,789 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-26 16:08:50,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:50,794 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-26 16:08:50,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:50,800 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-26 16:08:50,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:50,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:50,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841032536] [2021-03-26 16:08:50,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299472159] [2021-03-26 16:08:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-03-26 16:08:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:50,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 16:08:50,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:50,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:50,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:50,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:50,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:50,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:50,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,886 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-26 16:08:50,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:50,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:50,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:50,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:50,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,895 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:50,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:08:50,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,898 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:50,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:50,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:08:50,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:50,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:50,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:50,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:50,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2021-03-26 16:08:50,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949938332] [2021-03-26 16:08:50,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 16:08:50,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 16:08:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-26 16:08:50,909 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2021-03-26 16:08:50,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 1063 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:50,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:50,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2021-03-26 16:08:50,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:51,176 INFO L129 PetriNetUnfolder]: 592/1085 cut-off events. [2021-03-26 16:08:51,176 INFO L130 PetriNetUnfolder]: For 8152/8163 co-relation queries the response was YES. [2021-03-26 16:08:51,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6130 conditions, 1085 events. 592/1085 cut-off events. For 8152/8163 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6180 event pairs, 51 based on Foata normal form. 14/1099 useless extension candidates. Maximal degree in co-relation 5883. Up to 407 conditions per place. [2021-03-26 16:08:51,188 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 98 selfloop transitions, 48 changer transitions 0/152 dead transitions. [2021-03-26 16:08:51,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 152 transitions, 1915 flow [2021-03-26 16:08:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 16:08:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 16:08:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2021-03-26 16:08:51,189 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.43653846153846154 [2021-03-26 16:08:51,189 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 227 transitions. [2021-03-26 16:08:51,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 227 transitions. [2021-03-26 16:08:51,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:51,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 227 transitions. [2021-03-26 16:08:51,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:51,191 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-03-26 16:08:51,192 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-03-26 16:08:51,192 INFO L185 Difference]: Start difference. First operand has 85 places, 90 transitions, 1063 flow. Second operand 10 states and 227 transitions. [2021-03-26 16:08:51,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 152 transitions, 1915 flow [2021-03-26 16:08:51,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 152 transitions, 1841 flow, removed 29 selfloop flow, removed 2 redundant places. [2021-03-26 16:08:51,217 INFO L241 Difference]: Finished difference. Result has 95 places, 103 transitions, 1354 flow [2021-03-26 16:08:51,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1354, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2021-03-26 16:08:51,217 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 72 predicate places. [2021-03-26 16:08:51,217 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:51,218 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 103 transitions, 1354 flow [2021-03-26 16:08:51,218 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 103 transitions, 1354 flow [2021-03-26 16:08:51,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 103 transitions, 1354 flow [2021-03-26 16:08:51,257 INFO L129 PetriNetUnfolder]: 164/438 cut-off events. [2021-03-26 16:08:51,257 INFO L130 PetriNetUnfolder]: For 3900/4086 co-relation queries the response was YES. [2021-03-26 16:08:51,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 438 events. 164/438 cut-off events. For 3900/4086 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2680 event pairs, 15 based on Foata normal form. 11/443 useless extension candidates. Maximal degree in co-relation 2457. Up to 134 conditions per place. [2021-03-26 16:08:51,264 INFO L142 LiptonReduction]: Number of co-enabled transitions 790 [2021-03-26 16:08:51,277 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:51,277 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:51,277 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-26 16:08:51,277 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 1354 flow [2021-03-26 16:08:51,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:51,278 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:51,278 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:51,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-03-26 16:08:51,500 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2058412742, now seen corresponding path program 1 times [2021-03-26 16:08:51,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:51,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846469373] [2021-03-26 16:08:51,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:51,516 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-26 16:08:51,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:51,521 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-26 16:08:51,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:51,533 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-26 16:08:51,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:51,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:51,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846469373] [2021-03-26 16:08:51,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236091037] [2021-03-26 16:08:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-03-26 16:08:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:51,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 16:08:51,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:51,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:51,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:51,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:51,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:51,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:51,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:51,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,601 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-26 16:08:51,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:51,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:51,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:51,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:51,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:51,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:51,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:51,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:51,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,616 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:51,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:51,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:51,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:51,622 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-26 16:08:51,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:51,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:51,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:51,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-03-26 16:08:51,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959017141] [2021-03-26 16:08:51,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 16:08:51,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:51,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 16:08:51,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-26 16:08:51,632 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2021-03-26 16:08:51,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 1354 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:51,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:51,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2021-03-26 16:08:51,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:51,944 INFO L129 PetriNetUnfolder]: 593/1103 cut-off events. [2021-03-26 16:08:51,944 INFO L130 PetriNetUnfolder]: For 10867/10878 co-relation queries the response was YES. [2021-03-26 16:08:51,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6749 conditions, 1103 events. 593/1103 cut-off events. For 10867/10878 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6433 event pairs, 42 based on Foata normal form. 24/1127 useless extension candidates. Maximal degree in co-relation 6556. Up to 360 conditions per place. [2021-03-26 16:08:51,958 INFO L132 encePairwiseOnDemand]: 45/52 looper letters, 104 selfloop transitions, 51 changer transitions 1/162 dead transitions. [2021-03-26 16:08:51,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 162 transitions, 2156 flow [2021-03-26 16:08:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 16:08:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 16:08:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2021-03-26 16:08:51,960 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2021-03-26 16:08:51,960 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 247 transitions. [2021-03-26 16:08:51,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 247 transitions. [2021-03-26 16:08:51,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:51,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 247 transitions. [2021-03-26 16:08:51,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:51,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:51,963 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:51,963 INFO L185 Difference]: Start difference. First operand has 95 places, 103 transitions, 1354 flow. Second operand 11 states and 247 transitions. [2021-03-26 16:08:51,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 162 transitions, 2156 flow [2021-03-26 16:08:51,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 162 transitions, 2080 flow, removed 30 selfloop flow, removed 3 redundant places. [2021-03-26 16:08:51,995 INFO L241 Difference]: Finished difference. Result has 104 places, 103 transitions, 1426 flow [2021-03-26 16:08:51,995 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1426, PETRI_PLACES=104, PETRI_TRANSITIONS=103} [2021-03-26 16:08:51,995 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 81 predicate places. [2021-03-26 16:08:51,995 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:51,996 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 103 transitions, 1426 flow [2021-03-26 16:08:51,996 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 103 transitions, 1426 flow [2021-03-26 16:08:51,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 1426 flow [2021-03-26 16:08:52,039 INFO L129 PetriNetUnfolder]: 161/444 cut-off events. [2021-03-26 16:08:52,039 INFO L130 PetriNetUnfolder]: For 4459/4624 co-relation queries the response was YES. [2021-03-26 16:08:52,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 444 events. 161/444 cut-off events. For 4459/4624 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2830 event pairs, 15 based on Foata normal form. 14/449 useless extension candidates. Maximal degree in co-relation 2550. Up to 132 conditions per place. [2021-03-26 16:08:52,049 INFO L142 LiptonReduction]: Number of co-enabled transitions 796 [2021-03-26 16:08:52,056 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:52,056 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:52,056 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 61 [2021-03-26 16:08:52,057 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 103 transitions, 1426 flow [2021-03-26 16:08:52,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:52,058 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:52,058 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:52,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:52,280 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:52,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:52,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1870605874, now seen corresponding path program 5 times [2021-03-26 16:08:52,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:52,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180954629] [2021-03-26 16:08:52,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:52,321 INFO L142 QuantifierPusher]: treesize reduction 15, result has 51.6 percent of original size [2021-03-26 16:08:52,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,330 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.5 percent of original size [2021-03-26 16:08:52,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:08:52,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:52,346 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-26 16:08:52,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:08:52,359 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:08:52,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:52,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180954629] [2021-03-26 16:08:52,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280955488] [2021-03-26 16:08:52,369 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 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-03-26 16:08:52,401 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-26 16:08:52,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:08:52,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-26 16:08:52,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:52,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:52,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:52,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:08:52,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:52,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:08:52,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:52,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:08:52,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:08:52,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:52,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:52,448 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:52,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:52,464 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:52,464 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:33 [2021-03-26 16:08:52,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:52,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:52,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:52,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,497 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:52,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:52,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,499 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:52,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:52,504 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 15 treesize of output 11 [2021-03-26 16:08:52,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:52,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:52,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:52,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,517 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:52,517 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2021-03-26 16:08:52,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 16:08:52,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:52,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:08:52,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:52,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:52,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:52,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:52,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,580 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:52,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 16:08:52,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:52,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:52,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:52,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-26 16:08:52,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-26 16:08:52,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:52,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:52,592 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:52,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:52,601 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:52,601 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2021-03-26 16:08:52,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:52,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:52,621 INFO L142 QuantifierPusher]: treesize reduction 1, result has 94.7 percent of original size [2021-03-26 16:08:52,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:08:52,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:52,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:52,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:52,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:52,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:52,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:52,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2021-03-26 16:08:52,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388504977] [2021-03-26 16:08:52,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-26 16:08:52,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:52,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-26 16:08:52,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-03-26 16:08:52,664 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2021-03-26 16:08:52,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 103 transitions, 1426 flow. Second operand has 13 states, 13 states have (on average 15.538461538461538) internal successors, (202), 13 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:52,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:52,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2021-03-26 16:08:52,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:53,273 INFO L129 PetriNetUnfolder]: 715/1287 cut-off events. [2021-03-26 16:08:53,273 INFO L130 PetriNetUnfolder]: For 16940/16958 co-relation queries the response was YES. [2021-03-26 16:08:53,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8262 conditions, 1287 events. 715/1287 cut-off events. For 16940/16958 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7394 event pairs, 199 based on Foata normal form. 14/1299 useless extension candidates. Maximal degree in co-relation 8062. Up to 933 conditions per place. [2021-03-26 16:08:53,287 INFO L132 encePairwiseOnDemand]: 42/52 looper letters, 125 selfloop transitions, 37 changer transitions 2/170 dead transitions. [2021-03-26 16:08:53,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 170 transitions, 2483 flow [2021-03-26 16:08:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 16:08:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 16:08:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 224 transitions. [2021-03-26 16:08:53,289 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2021-03-26 16:08:53,289 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 224 transitions. [2021-03-26 16:08:53,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 224 transitions. [2021-03-26 16:08:53,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:53,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 224 transitions. [2021-03-26 16:08:53,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.4) internal successors, (224), 10 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:53,291 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-03-26 16:08:53,293 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-03-26 16:08:53,293 INFO L185 Difference]: Start difference. First operand has 104 places, 103 transitions, 1426 flow. Second operand 10 states and 224 transitions. [2021-03-26 16:08:53,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 170 transitions, 2483 flow [2021-03-26 16:08:53,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 170 transitions, 2352 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-03-26 16:08:53,328 INFO L241 Difference]: Finished difference. Result has 110 places, 126 transitions, 1781 flow [2021-03-26 16:08:53,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1781, PETRI_PLACES=110, PETRI_TRANSITIONS=126} [2021-03-26 16:08:53,328 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 87 predicate places. [2021-03-26 16:08:53,328 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:53,329 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 126 transitions, 1781 flow [2021-03-26 16:08:53,329 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 126 transitions, 1781 flow [2021-03-26 16:08:53,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 126 transitions, 1781 flow [2021-03-26 16:08:53,405 INFO L129 PetriNetUnfolder]: 213/577 cut-off events. [2021-03-26 16:08:53,405 INFO L130 PetriNetUnfolder]: For 6638/6781 co-relation queries the response was YES. [2021-03-26 16:08:53,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 577 events. 213/577 cut-off events. For 6638/6781 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3900 event pairs, 16 based on Foata normal form. 17/582 useless extension candidates. Maximal degree in co-relation 3417. Up to 165 conditions per place. [2021-03-26 16:08:53,415 INFO L142 LiptonReduction]: Number of co-enabled transitions 966 [2021-03-26 16:08:53,451 INFO L154 LiptonReduction]: Checked pairs total: 6 [2021-03-26 16:08:53,451 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 16:08:53,451 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-03-26 16:08:53,455 INFO L480 AbstractCegarLoop]: Abstraction has has 110 places, 126 transitions, 1784 flow [2021-03-26 16:08:53,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 15.538461538461538) internal successors, (202), 13 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:53,455 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:53,455 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:53,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-03-26 16:08:53,676 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash -280549092, now seen corresponding path program 6 times [2021-03-26 16:08:53,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:53,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085432095] [2021-03-26 16:08:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:53,694 INFO L142 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size [2021-03-26 16:08:53,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,708 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.0 percent of original size [2021-03-26 16:08:53,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:08:53,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,737 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:08:53,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:53,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085432095] [2021-03-26 16:08:53,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043032628] [2021-03-26 16:08:53,746 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-26 16:08:53,784 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-26 16:08:53,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:08:53,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-26 16:08:53,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:53,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:53,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:53,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:53,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:53,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:53,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:53,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:53,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:53,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,806 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:53,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:53,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:53,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:08:53,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:53,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:53,812 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:53,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:53,821 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2021-03-26 16:08:53,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:53,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,848 INFO L147 QuantifierPusher]: treesize reduction 2, result has 92.9 percent of original size 26 [2021-03-26 16:08:53,848 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.1 percent of original size [2021-03-26 16:08:53,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:53,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:53,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:08:53,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:53,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:53,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:08:53,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-26 16:08:53,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:53,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:53,857 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:53,863 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,863 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-26 16:08:53,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,864 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:53,864 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-03-26 16:08:53,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:53,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:53,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:53,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:53,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:53,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:53,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:53,905 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-03-26 16:08:53,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:53,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:53,907 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:53,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,913 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:53,914 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-26 16:08:53,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,929 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-26 16:08:53,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:53,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:53,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:53,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:53,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:53,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:53,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:53,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-26 16:08:53,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17015526] [2021-03-26 16:08:53,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 16:08:53,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:53,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 16:08:53,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-03-26 16:08:53,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-26 16:08:53,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 126 transitions, 1784 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:53,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:53,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-26 16:08:53,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:54,537 INFO L129 PetriNetUnfolder]: 860/1535 cut-off events. [2021-03-26 16:08:54,537 INFO L130 PetriNetUnfolder]: For 22314/22325 co-relation queries the response was YES. [2021-03-26 16:08:54,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10170 conditions, 1535 events. 860/1535 cut-off events. For 22314/22325 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 9007 event pairs, 227 based on Foata normal form. 14/1549 useless extension candidates. Maximal degree in co-relation 9957. Up to 931 conditions per place. [2021-03-26 16:08:54,561 INFO L132 encePairwiseOnDemand]: 42/53 looper letters, 138 selfloop transitions, 51 changer transitions 14/209 dead transitions. [2021-03-26 16:08:54,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 209 transitions, 3305 flow [2021-03-26 16:08:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 16:08:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 16:08:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2021-03-26 16:08:54,562 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.42641509433962266 [2021-03-26 16:08:54,562 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 226 transitions. [2021-03-26 16:08:54,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 226 transitions. [2021-03-26 16:08:54,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:54,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 226 transitions. [2021-03-26 16:08:54,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.6) internal successors, (226), 10 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:54,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:54,566 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:54,566 INFO L185 Difference]: Start difference. First operand has 110 places, 126 transitions, 1784 flow. Second operand 10 states and 226 transitions. [2021-03-26 16:08:54,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 209 transitions, 3305 flow [2021-03-26 16:08:54,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 209 transitions, 3065 flow, removed 113 selfloop flow, removed 2 redundant places. [2021-03-26 16:08:54,615 INFO L241 Difference]: Finished difference. Result has 121 places, 146 transitions, 2103 flow [2021-03-26 16:08:54,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2103, PETRI_PLACES=121, PETRI_TRANSITIONS=146} [2021-03-26 16:08:54,616 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 98 predicate places. [2021-03-26 16:08:54,616 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:54,616 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 146 transitions, 2103 flow [2021-03-26 16:08:54,616 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 146 transitions, 2103 flow [2021-03-26 16:08:54,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 146 transitions, 2103 flow [2021-03-26 16:08:54,671 INFO L129 PetriNetUnfolder]: 236/597 cut-off events. [2021-03-26 16:08:54,671 INFO L130 PetriNetUnfolder]: For 8231/8736 co-relation queries the response was YES. [2021-03-26 16:08:54,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 597 events. 236/597 cut-off events. For 8231/8736 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3872 event pairs, 18 based on Foata normal form. 22/599 useless extension candidates. Maximal degree in co-relation 3627. Up to 175 conditions per place. [2021-03-26 16:08:54,681 INFO L142 LiptonReduction]: Number of co-enabled transitions 1082 [2021-03-26 16:08:54,689 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:54,689 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:54,690 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 74 [2021-03-26 16:08:54,690 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 146 transitions, 2103 flow [2021-03-26 16:08:54,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:54,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:54,690 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:54,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-03-26 16:08:54,911 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:54,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:54,912 INFO L82 PathProgramCache]: Analyzing trace with hash -291306035, now seen corresponding path program 1 times [2021-03-26 16:08:54,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:54,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295535112] [2021-03-26 16:08:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:54,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:54,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:54,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:54,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:54,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295535112] [2021-03-26 16:08:54,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515330064] [2021-03-26 16:08:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-03-26 16:08:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:54,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 16:08:54,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:54,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:54,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,995 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:54,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:54,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:54,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:54,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:54,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:55,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:55,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:55,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,005 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:55,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:55,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:55,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:55,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:08:55,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:55,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,026 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-26 16:08:55,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:55,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:55,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-26 16:08:55,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426267022] [2021-03-26 16:08:55,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 16:08:55,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 16:08:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 16:08:55,035 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 53 [2021-03-26 16:08:55,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 146 transitions, 2103 flow. Second operand has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:55,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:55,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 53 [2021-03-26 16:08:55,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:55,186 INFO L129 PetriNetUnfolder]: 625/1241 cut-off events. [2021-03-26 16:08:55,186 INFO L130 PetriNetUnfolder]: For 15734/15995 co-relation queries the response was YES. [2021-03-26 16:08:55,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7932 conditions, 1241 events. 625/1241 cut-off events. For 15734/15995 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 7967 event pairs, 86 based on Foata normal form. 29/1220 useless extension candidates. Maximal degree in co-relation 7738. Up to 330 conditions per place. [2021-03-26 16:08:55,196 INFO L132 encePairwiseOnDemand]: 49/53 looper letters, 68 selfloop transitions, 61 changer transitions 0/172 dead transitions. [2021-03-26 16:08:55,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 172 transitions, 2699 flow [2021-03-26 16:08:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 16:08:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 16:08:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2021-03-26 16:08:55,197 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.720125786163522 [2021-03-26 16:08:55,197 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 229 transitions. [2021-03-26 16:08:55,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 229 transitions. [2021-03-26 16:08:55,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:55,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 229 transitions. [2021-03-26 16:08:55,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:55,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:55,198 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:55,199 INFO L185 Difference]: Start difference. First operand has 121 places, 146 transitions, 2103 flow. Second operand 6 states and 229 transitions. [2021-03-26 16:08:55,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 172 transitions, 2699 flow [2021-03-26 16:08:55,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 172 transitions, 2546 flow, removed 58 selfloop flow, removed 4 redundant places. [2021-03-26 16:08:55,237 INFO L241 Difference]: Finished difference. Result has 125 places, 152 transitions, 2289 flow [2021-03-26 16:08:55,238 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1958, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2289, PETRI_PLACES=125, PETRI_TRANSITIONS=152} [2021-03-26 16:08:55,238 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 102 predicate places. [2021-03-26 16:08:55,238 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:55,238 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 152 transitions, 2289 flow [2021-03-26 16:08:55,238 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 152 transitions, 2289 flow [2021-03-26 16:08:55,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 152 transitions, 2289 flow [2021-03-26 16:08:55,290 INFO L129 PetriNetUnfolder]: 284/748 cut-off events. [2021-03-26 16:08:55,290 INFO L130 PetriNetUnfolder]: For 10701/10993 co-relation queries the response was YES. [2021-03-26 16:08:55,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 748 events. 284/748 cut-off events. For 10701/10993 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5322 event pairs, 19 based on Foata normal form. 21/753 useless extension candidates. Maximal degree in co-relation 4944. Up to 223 conditions per place. [2021-03-26 16:08:55,299 INFO L142 LiptonReduction]: Number of co-enabled transitions 1160 [2021-03-26 16:08:55,306 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:55,306 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:55,306 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-03-26 16:08:55,307 INFO L480 AbstractCegarLoop]: Abstraction has has 125 places, 152 transitions, 2289 flow [2021-03-26 16:08:55,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:55,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:55,307 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:55,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-03-26 16:08:55,528 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:55,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:55,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2116308476, now seen corresponding path program 7 times [2021-03-26 16:08:55,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:55,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291842358] [2021-03-26 16:08:55,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:55,561 INFO L142 QuantifierPusher]: treesize reduction 15, result has 51.6 percent of original size [2021-03-26 16:08:55,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,569 INFO L142 QuantifierPusher]: treesize reduction 8, result has 76.5 percent of original size [2021-03-26 16:08:55,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 16:08:55,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:55,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:55,595 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:08:55,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:55,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291842358] [2021-03-26 16:08:55,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22915429] [2021-03-26 16:08:55,604 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-26 16:08:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:55,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-26 16:08:55,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:55,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:55,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:55,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,654 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:55,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:55,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:55,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:55,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:55,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:08:55,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:08:55,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:55,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:55,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:55,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:55,671 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2021-03-26 16:08:55,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:08:55,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,698 INFO L147 QuantifierPusher]: treesize reduction 2, result has 93.9 percent of original size 31 [2021-03-26 16:08:55,699 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.1 percent of original size [2021-03-26 16:08:55,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:55,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:55,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:55,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:08:55,705 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 17 treesize of output 13 [2021-03-26 16:08:55,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:55,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:55,707 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:55,715 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,715 INFO L142 QuantifierPusher]: treesize reduction 3, result has 88.5 percent of original size [2021-03-26 16:08:55,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:55,716 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:55,716 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2021-03-26 16:08:55,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:55,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:55,733 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.3 percent of original size [2021-03-26 16:08:55,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 16:08:55,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:55,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:08:55,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:55,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:08:55,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:55,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,756 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:55,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:55,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:55,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:55,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:55,761 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-03-26 16:08:55,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:55,762 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:55,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,768 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:55,768 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-26 16:08:55,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:55,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:55,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:55,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-26 16:08:55,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040479062] [2021-03-26 16:08:55,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 16:08:55,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:55,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 16:08:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-26 16:08:55,800 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-26 16:08:55,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 152 transitions, 2289 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:55,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:55,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-26 16:08:55,801 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:56,145 INFO L129 PetriNetUnfolder]: 993/1781 cut-off events. [2021-03-26 16:08:56,146 INFO L130 PetriNetUnfolder]: For 29607/29618 co-relation queries the response was YES. [2021-03-26 16:08:56,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12691 conditions, 1781 events. 993/1781 cut-off events. For 29607/29618 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10869 event pairs, 306 based on Foata normal form. 14/1795 useless extension candidates. Maximal degree in co-relation 12446. Up to 1447 conditions per place. [2021-03-26 16:08:56,158 INFO L132 encePairwiseOnDemand]: 45/53 looper letters, 153 selfloop transitions, 27 changer transitions 13/199 dead transitions. [2021-03-26 16:08:56,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 199 transitions, 3381 flow [2021-03-26 16:08:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 16:08:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 16:08:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2021-03-26 16:08:56,159 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.40970350404312667 [2021-03-26 16:08:56,159 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 152 transitions. [2021-03-26 16:08:56,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 152 transitions. [2021-03-26 16:08:56,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:56,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 152 transitions. [2021-03-26 16:08:56,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 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-03-26 16:08:56,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:56,160 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:56,160 INFO L185 Difference]: Start difference. First operand has 125 places, 152 transitions, 2289 flow. Second operand 7 states and 152 transitions. [2021-03-26 16:08:56,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 199 transitions, 3381 flow [2021-03-26 16:08:56,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 199 transitions, 3339 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-03-26 16:08:56,208 INFO L241 Difference]: Finished difference. Result has 132 places, 163 transitions, 2507 flow [2021-03-26 16:08:56,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2507, PETRI_PLACES=132, PETRI_TRANSITIONS=163} [2021-03-26 16:08:56,208 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 109 predicate places. [2021-03-26 16:08:56,208 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:56,208 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 163 transitions, 2507 flow [2021-03-26 16:08:56,208 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 163 transitions, 2507 flow [2021-03-26 16:08:56,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 163 transitions, 2507 flow [2021-03-26 16:08:56,267 INFO L129 PetriNetUnfolder]: 301/781 cut-off events. [2021-03-26 16:08:56,267 INFO L130 PetriNetUnfolder]: For 12084/12398 co-relation queries the response was YES. [2021-03-26 16:08:56,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 781 events. 301/781 cut-off events. For 12084/12398 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5612 event pairs, 25 based on Foata normal form. 26/791 useless extension candidates. Maximal degree in co-relation 5090. Up to 232 conditions per place. [2021-03-26 16:08:56,277 INFO L142 LiptonReduction]: Number of co-enabled transitions 1202 [2021-03-26 16:08:56,282 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:56,282 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:56,282 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 74 [2021-03-26 16:08:56,282 INFO L480 AbstractCegarLoop]: Abstraction has has 132 places, 163 transitions, 2507 flow [2021-03-26 16:08:56,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:56,283 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:56,283 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:56,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-03-26 16:08:56,483 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash 429636254, now seen corresponding path program 8 times [2021-03-26 16:08:56,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:56,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652573872] [2021-03-26 16:08:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:56,521 INFO L142 QuantifierPusher]: treesize reduction 19, result has 50.0 percent of original size [2021-03-26 16:08:56,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:56,536 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.7 percent of original size [2021-03-26 16:08:56,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:08:56,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:08:56,554 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-26 16:08:56,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:08:56,565 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:08:56,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:56,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652573872] [2021-03-26 16:08:56,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709611636] [2021-03-26 16:08:56,573 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:56,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-26 16:08:56,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:08:56,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-26 16:08:56,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:56,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:08:56,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:56,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:56,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:56,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:56,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:56,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:56,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:56,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:56,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:08:56,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:08:56,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:56,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:56,620 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:56,630 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,630 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:56,631 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-03-26 16:08:56,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:08:56,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,660 INFO L147 QuantifierPusher]: treesize reduction 4, result has 87.1 percent of original size 27 [2021-03-26 16:08:56,660 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.5 percent of original size [2021-03-26 16:08:56,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:56,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:56,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:08:56,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:56,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:56,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:08:56,667 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 15 treesize of output 11 [2021-03-26 16:08:56,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:56,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:56,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:56,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:56,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:56,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2021-03-26 16:08:56,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:56,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:08:56,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:08:56,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:56,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:56,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:56,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:56,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 16:08:56,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:08:56,697 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-03-26 16:08:56,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:56,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:56,698 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:08:56,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,712 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:08:56,712 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-26 16:08:56,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,729 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-26 16:08:56,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:08:56,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:56,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:56,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:08:56,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:56,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:56,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:56,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-26 16:08:56,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803745634] [2021-03-26 16:08:56,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 16:08:56,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 16:08:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-26 16:08:56,757 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-26 16:08:56,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 163 transitions, 2507 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:56,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:56,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-26 16:08:56,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:57,331 INFO L129 PetriNetUnfolder]: 1203/2178 cut-off events. [2021-03-26 16:08:57,331 INFO L130 PetriNetUnfolder]: For 38732/38750 co-relation queries the response was YES. [2021-03-26 16:08:57,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15792 conditions, 2178 events. 1203/2178 cut-off events. For 38732/38750 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13752 event pairs, 309 based on Foata normal form. 18/2194 useless extension candidates. Maximal degree in co-relation 15537. Up to 1508 conditions per place. [2021-03-26 16:08:57,358 INFO L132 encePairwiseOnDemand]: 43/53 looper letters, 188 selfloop transitions, 50 changer transitions 2/246 dead transitions. [2021-03-26 16:08:57,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 246 transitions, 4039 flow [2021-03-26 16:08:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 16:08:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 16:08:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 251 transitions. [2021-03-26 16:08:57,360 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4305317324185249 [2021-03-26 16:08:57,360 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 251 transitions. [2021-03-26 16:08:57,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 251 transitions. [2021-03-26 16:08:57,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:57,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 251 transitions. [2021-03-26 16:08:57,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 22.818181818181817) internal successors, (251), 11 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:57,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:57,362 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:57,362 INFO L185 Difference]: Start difference. First operand has 132 places, 163 transitions, 2507 flow. Second operand 11 states and 251 transitions. [2021-03-26 16:08:57,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 246 transitions, 4039 flow [2021-03-26 16:08:57,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 246 transitions, 3934 flow, removed 43 selfloop flow, removed 2 redundant places. [2021-03-26 16:08:57,461 INFO L241 Difference]: Finished difference. Result has 147 places, 189 transitions, 3066 flow [2021-03-26 16:08:57,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3066, PETRI_PLACES=147, PETRI_TRANSITIONS=189} [2021-03-26 16:08:57,462 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 124 predicate places. [2021-03-26 16:08:57,462 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:57,462 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 189 transitions, 3066 flow [2021-03-26 16:08:57,462 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 189 transitions, 3066 flow [2021-03-26 16:08:57,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 189 transitions, 3066 flow [2021-03-26 16:08:57,539 INFO L129 PetriNetUnfolder]: 345/905 cut-off events. [2021-03-26 16:08:57,539 INFO L130 PetriNetUnfolder]: For 15182/15490 co-relation queries the response was YES. [2021-03-26 16:08:57,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 905 events. 345/905 cut-off events. For 15182/15490 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6677 event pairs, 27 based on Foata normal form. 25/908 useless extension candidates. Maximal degree in co-relation 6223. Up to 269 conditions per place. [2021-03-26 16:08:57,552 INFO L142 LiptonReduction]: Number of co-enabled transitions 1386 [2021-03-26 16:08:57,561 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:57,561 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:57,561 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 99 [2021-03-26 16:08:57,562 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 189 transitions, 3066 flow [2021-03-26 16:08:57,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:57,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:57,562 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:57,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:57,775 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1951992119, now seen corresponding path program 9 times [2021-03-26 16:08:57,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:57,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317922237] [2021-03-26 16:08:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:57,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:57,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:08:57,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317922237] [2021-03-26 16:08:57,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021224158] [2021-03-26 16:08:57,804 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:57,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-26 16:08:57,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:08:57,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 16:08:57,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:57,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,843 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:57,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:57,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:57,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,845 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:57,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:57,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:57,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:57,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:57,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:57,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,862 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:57,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:57,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:57,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:57,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:57,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:57,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:57,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:57,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:57,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:57,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:57,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:57,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 16:08:57,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:57,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-26 16:08:57,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579304782] [2021-03-26 16:08:57,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 16:08:57,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:57,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 16:08:57,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-26 16:08:57,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-26 16:08:57,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 189 transitions, 3066 flow. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:57,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:57,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-26 16:08:57,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:08:58,811 INFO L129 PetriNetUnfolder]: 2416/4318 cut-off events. [2021-03-26 16:08:58,811 INFO L130 PetriNetUnfolder]: For 97839/97850 co-relation queries the response was YES. [2021-03-26 16:08:58,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33923 conditions, 4318 events. 2416/4318 cut-off events. For 97839/97850 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 30702 event pairs, 187 based on Foata normal form. 158/4476 useless extension candidates. Maximal degree in co-relation 33308. Up to 1270 conditions per place. [2021-03-26 16:08:58,861 INFO L132 encePairwiseOnDemand]: 29/53 looper letters, 336 selfloop transitions, 223 changer transitions 0/565 dead transitions. [2021-03-26 16:08:58,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 565 transitions, 10538 flow [2021-03-26 16:08:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-03-26 16:08:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-03-26 16:08:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 493 transitions. [2021-03-26 16:08:58,863 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4044298605414274 [2021-03-26 16:08:58,863 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 493 transitions. [2021-03-26 16:08:58,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 493 transitions. [2021-03-26 16:08:58,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:08:58,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 493 transitions. [2021-03-26 16:08:58,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 21.434782608695652) internal successors, (493), 23 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:58,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 53.0) internal successors, (1272), 24 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:58,866 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 53.0) internal successors, (1272), 24 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:58,866 INFO L185 Difference]: Start difference. First operand has 147 places, 189 transitions, 3066 flow. Second operand 23 states and 493 transitions. [2021-03-26 16:08:58,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 565 transitions, 10538 flow [2021-03-26 16:08:59,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 565 transitions, 10226 flow, removed 149 selfloop flow, removed 2 redundant places. [2021-03-26 16:08:59,114 INFO L241 Difference]: Finished difference. Result has 185 places, 369 transitions, 7345 flow [2021-03-26 16:08:59,114 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2884, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7345, PETRI_PLACES=185, PETRI_TRANSITIONS=369} [2021-03-26 16:08:59,114 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 162 predicate places. [2021-03-26 16:08:59,114 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:08:59,114 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 369 transitions, 7345 flow [2021-03-26 16:08:59,115 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 369 transitions, 7345 flow [2021-03-26 16:08:59,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 185 places, 369 transitions, 7345 flow [2021-03-26 16:08:59,440 INFO L129 PetriNetUnfolder]: 1139/2541 cut-off events. [2021-03-26 16:08:59,440 INFO L130 PetriNetUnfolder]: For 101989/103347 co-relation queries the response was YES. [2021-03-26 16:08:59,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23658 conditions, 2541 events. 1139/2541 cut-off events. For 101989/103347 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 20866 event pairs, 136 based on Foata normal form. 122/2541 useless extension candidates. Maximal degree in co-relation 23280. Up to 731 conditions per place. [2021-03-26 16:08:59,490 INFO L142 LiptonReduction]: Number of co-enabled transitions 2194 [2021-03-26 16:08:59,509 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:08:59,509 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:08:59,509 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 395 [2021-03-26 16:08:59,510 INFO L480 AbstractCegarLoop]: Abstraction has has 185 places, 369 transitions, 7345 flow [2021-03-26 16:08:59,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:59,510 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:08:59,510 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:08:59,712 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:59,712 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:08:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:08:59,712 INFO L82 PathProgramCache]: Analyzing trace with hash 439356906, now seen corresponding path program 1 times [2021-03-26 16:08:59,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:08:59,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938260764] [2021-03-26 16:08:59,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:08:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:59,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:08:59,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 16:08:59,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938260764] [2021-03-26 16:08:59,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956992270] [2021-03-26 16:08:59,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:08:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:08:59,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 16:08:59,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:08:59,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:59,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:59,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:59,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:59,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:59,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:59,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,781 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-26 16:08:59,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:59,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:59,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:08:59,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:08:59,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:08:59,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:59,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:59,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:59,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,790 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:08:59,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:08:59,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:08:59,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:08:59,793 INFO L142 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size [2021-03-26 16:08:59,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:08:59,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:08:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 16:08:59,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:08:59,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-03-26 16:08:59,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318637332] [2021-03-26 16:08:59,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 16:08:59,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:08:59,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 16:08:59,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 16:08:59,805 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2021-03-26 16:08:59,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 369 transitions, 7345 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:08:59,806 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:08:59,806 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2021-03-26 16:08:59,806 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:09:00,849 INFO L129 PetriNetUnfolder]: 3164/5682 cut-off events. [2021-03-26 16:09:00,849 INFO L130 PetriNetUnfolder]: For 248853/248864 co-relation queries the response was YES. [2021-03-26 16:09:00,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57408 conditions, 5682 events. 3164/5682 cut-off events. For 248853/248864 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 41734 event pairs, 381 based on Foata normal form. 109/5791 useless extension candidates. Maximal degree in co-relation 56544. Up to 1957 conditions per place. [2021-03-26 16:09:00,921 INFO L132 encePairwiseOnDemand]: 39/53 looper letters, 503 selfloop transitions, 186 changer transitions 34/729 dead transitions. [2021-03-26 16:09:00,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 729 transitions, 16586 flow [2021-03-26 16:09:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 16:09:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 16:09:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2021-03-26 16:09:00,923 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.45073375262054505 [2021-03-26 16:09:00,923 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 215 transitions. [2021-03-26 16:09:00,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 215 transitions. [2021-03-26 16:09:00,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:09:00,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 215 transitions. [2021-03-26 16:09:00,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.88888888888889) internal successors, (215), 9 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:00,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:00,924 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:00,925 INFO L185 Difference]: Start difference. First operand has 185 places, 369 transitions, 7345 flow. Second operand 9 states and 215 transitions. [2021-03-26 16:09:00,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 729 transitions, 16586 flow [2021-03-26 16:09:01,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 729 transitions, 15469 flow, removed 555 selfloop flow, removed 2 redundant places. [2021-03-26 16:09:01,632 INFO L241 Difference]: Finished difference. Result has 196 places, 468 transitions, 9826 flow [2021-03-26 16:09:01,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=6433, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9826, PETRI_PLACES=196, PETRI_TRANSITIONS=468} [2021-03-26 16:09:01,632 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 173 predicate places. [2021-03-26 16:09:01,633 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:09:01,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 468 transitions, 9826 flow [2021-03-26 16:09:01,633 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 468 transitions, 9826 flow [2021-03-26 16:09:01,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 195 places, 468 transitions, 9826 flow [2021-03-26 16:09:02,130 INFO L129 PetriNetUnfolder]: 1569/3431 cut-off events. [2021-03-26 16:09:02,130 INFO L130 PetriNetUnfolder]: For 157060/158645 co-relation queries the response was YES. [2021-03-26 16:09:02,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34409 conditions, 3431 events. 1569/3431 cut-off events. For 157060/158645 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 28656 event pairs, 172 based on Foata normal form. 155/3448 useless extension candidates. Maximal degree in co-relation 33731. Up to 976 conditions per place. [2021-03-26 16:09:02,271 INFO L142 LiptonReduction]: Number of co-enabled transitions 2422 [2021-03-26 16:09:02,312 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:09:02,312 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:09:02,312 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 679 [2021-03-26 16:09:02,312 INFO L480 AbstractCegarLoop]: Abstraction has has 195 places, 468 transitions, 9826 flow [2021-03-26 16:09:02,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:02,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:09:02,313 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:09:02,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:09:02,528 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:09:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:09:02,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1140117948, now seen corresponding path program 10 times [2021-03-26 16:09:02,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:09:02,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216804316] [2021-03-26 16:09:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:09:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:09:02,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:09:02,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:09:02,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216804316] [2021-03-26 16:09:02,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228297816] [2021-03-26 16:09:02,591 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:09:02,620 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-26 16:09:02,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:09:02,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 16:09:02,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:09:02,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:02,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:02,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:09:02,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:02,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:02,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:09:02,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:02,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:09:02,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:09:02,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:02,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:09:02,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:09:02,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:02,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:09:02,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:09:02,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:02,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:09:02,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:09:02,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:02,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:02,657 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-26 16:09:02,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:02,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:09:02,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:09:02,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-26 16:09:02,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171974576] [2021-03-26 16:09:02,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 16:09:02,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:09:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 16:09:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 16:09:02,674 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 53 [2021-03-26 16:09:02,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 468 transitions, 9826 flow. Second operand has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:02,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:09:02,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 53 [2021-03-26 16:09:02,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:09:04,306 INFO L129 PetriNetUnfolder]: 3709/7232 cut-off events. [2021-03-26 16:09:04,306 INFO L130 PetriNetUnfolder]: For 344303/345815 co-relation queries the response was YES. [2021-03-26 16:09:04,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77327 conditions, 7232 events. 3709/7232 cut-off events. For 344303/345815 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 59944 event pairs, 431 based on Foata normal form. 185/7222 useless extension candidates. Maximal degree in co-relation 76695. Up to 2362 conditions per place. [2021-03-26 16:09:04,513 INFO L132 encePairwiseOnDemand]: 49/53 looper letters, 435 selfloop transitions, 223 changer transitions 2/733 dead transitions. [2021-03-26 16:09:04,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 733 transitions, 18303 flow [2021-03-26 16:09:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 16:09:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 16:09:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2021-03-26 16:09:04,515 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7232704402515723 [2021-03-26 16:09:04,515 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 230 transitions. [2021-03-26 16:09:04,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 230 transitions. [2021-03-26 16:09:04,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:09:04,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 230 transitions. [2021-03-26 16:09:04,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:04,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:04,516 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:04,516 INFO L185 Difference]: Start difference. First operand has 195 places, 468 transitions, 9826 flow. Second operand 6 states and 230 transitions. [2021-03-26 16:09:04,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 733 transitions, 18303 flow [2021-03-26 16:09:05,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 733 transitions, 17282 flow, removed 494 selfloop flow, removed 4 redundant places. [2021-03-26 16:09:05,248 INFO L241 Difference]: Finished difference. Result has 199 places, 605 transitions, 14174 flow [2021-03-26 16:09:05,248 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=9350, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14174, PETRI_PLACES=199, PETRI_TRANSITIONS=605} [2021-03-26 16:09:05,248 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 176 predicate places. [2021-03-26 16:09:05,249 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:09:05,249 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 605 transitions, 14174 flow [2021-03-26 16:09:05,249 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 605 transitions, 14174 flow [2021-03-26 16:09:05,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 199 places, 605 transitions, 14174 flow [2021-03-26 16:09:06,385 INFO L129 PetriNetUnfolder]: 2774/6032 cut-off events. [2021-03-26 16:09:06,385 INFO L130 PetriNetUnfolder]: For 314832/318786 co-relation queries the response was YES. [2021-03-26 16:09:06,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64770 conditions, 6032 events. 2774/6032 cut-off events. For 314832/318786 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 54483 event pairs, 384 based on Foata normal form. 329/6071 useless extension candidates. Maximal degree in co-relation 64120. Up to 1949 conditions per place. [2021-03-26 16:09:06,538 INFO L142 LiptonReduction]: Number of co-enabled transitions 3226 [2021-03-26 16:09:06,583 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:09:06,584 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:09:06,584 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1335 [2021-03-26 16:09:06,584 INFO L480 AbstractCegarLoop]: Abstraction has has 199 places, 605 transitions, 14174 flow [2021-03-26 16:09:06,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:06,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:09:06,584 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:09:06,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-03-26 16:09:06,785 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:09:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:09:06,785 INFO L82 PathProgramCache]: Analyzing trace with hash -15731548, now seen corresponding path program 11 times [2021-03-26 16:09:06,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:09:06,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414793746] [2021-03-26 16:09:06,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:09:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:09:06,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:09:06,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:09:06,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414793746] [2021-03-26 16:09:06,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162709936] [2021-03-26 16:09:06,811 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:09:06,843 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-26 16:09:06,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:09:06,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-26 16:09:06,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:09:06,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:09:06,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:06,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:09:06,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:09:06,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,868 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:06,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:06,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:09:06,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:06,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:06,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:09:06,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:06,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:06,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:09:06,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:06,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:06,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:09:06,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:06,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,947 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:06,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:09:06,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:09:06,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:06,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:09:06,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:09:06,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:06,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:06,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 16:09:06,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:09:06,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-26 16:09:06,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185656742] [2021-03-26 16:09:06,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 16:09:06,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:09:06,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 16:09:06,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-26 16:09:06,966 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-26 16:09:06,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 605 transitions, 14174 flow. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:06,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:09:06,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-26 16:09:06,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:09:13,405 INFO L129 PetriNetUnfolder]: 12523/22270 cut-off events. [2021-03-26 16:09:13,405 INFO L130 PetriNetUnfolder]: For 1262302/1262338 co-relation queries the response was YES. [2021-03-26 16:09:13,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252522 conditions, 22270 events. 12523/22270 cut-off events. For 1262302/1262338 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 194062 event pairs, 522 based on Foata normal form. 687/22957 useless extension candidates. Maximal degree in co-relation 252270. Up to 7371 conditions per place. [2021-03-26 16:09:13,961 INFO L132 encePairwiseOnDemand]: 34/53 looper letters, 1242 selfloop transitions, 774 changer transitions 105/2127 dead transitions. [2021-03-26 16:09:13,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 2127 transitions, 58854 flow [2021-03-26 16:09:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-26 16:09:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-03-26 16:09:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 548 transitions. [2021-03-26 16:09:13,963 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.397677793904209 [2021-03-26 16:09:13,963 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 548 transitions. [2021-03-26 16:09:13,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 548 transitions. [2021-03-26 16:09:13,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:09:13,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 548 transitions. [2021-03-26 16:09:13,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 21.076923076923077) internal successors, (548), 26 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:13,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 53.0) internal successors, (1431), 27 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:13,966 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 53.0) internal successors, (1431), 27 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:13,966 INFO L185 Difference]: Start difference. First operand has 199 places, 605 transitions, 14174 flow. Second operand 26 states and 548 transitions. [2021-03-26 16:09:13,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 2127 transitions, 58854 flow [2021-03-26 16:09:17,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 2127 transitions, 57146 flow, removed 828 selfloop flow, removed 4 redundant places. [2021-03-26 16:09:17,641 INFO L241 Difference]: Finished difference. Result has 239 places, 1227 transitions, 34032 flow [2021-03-26 16:09:17,641 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=13458, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=34032, PETRI_PLACES=239, PETRI_TRANSITIONS=1227} [2021-03-26 16:09:17,642 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 216 predicate places. [2021-03-26 16:09:17,642 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:09:17,642 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 1227 transitions, 34032 flow [2021-03-26 16:09:17,642 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 1227 transitions, 34032 flow [2021-03-26 16:09:17,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 234 places, 1227 transitions, 34032 flow [2021-03-26 16:09:21,956 INFO L129 PetriNetUnfolder]: 7405/15162 cut-off events. [2021-03-26 16:09:21,956 INFO L130 PetriNetUnfolder]: For 1148014/1158042 co-relation queries the response was YES. [2021-03-26 16:09:22,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190133 conditions, 15162 events. 7405/15162 cut-off events. For 1148014/1158042 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 148534 event pairs, 673 based on Foata normal form. 1091/15893 useless extension candidates. Maximal degree in co-relation 189978. Up to 5118 conditions per place. [2021-03-26 16:09:22,570 INFO L142 LiptonReduction]: Number of co-enabled transitions 5012 [2021-03-26 16:09:22,988 INFO L154 LiptonReduction]: Checked pairs total: 4 [2021-03-26 16:09:22,988 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 16:09:22,988 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5346 [2021-03-26 16:09:22,989 INFO L480 AbstractCegarLoop]: Abstraction has has 234 places, 1227 transitions, 34057 flow [2021-03-26 16:09:22,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:22,989 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:09:22,989 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:09:23,194 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-03-26 16:09:23,194 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:09:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:09:23,194 INFO L82 PathProgramCache]: Analyzing trace with hash 531126698, now seen corresponding path program 1 times [2021-03-26 16:09:23,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:09:23,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554505931] [2021-03-26 16:09:23,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:09:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:09:23,213 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-26 16:09:23,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:09:23,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:23,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:23,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:09:23,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554505931] [2021-03-26 16:09:23,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058224131] [2021-03-26 16:09:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:09:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:09:23,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-26 16:09:23,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:09:23,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:09:23,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:23,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:09:23,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:09:23,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:23,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:23,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:09:23,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:23,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:23,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:09:23,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:23,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:23,277 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-26 16:09:23,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:23,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,279 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:23,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:09:23,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:09:23,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:23,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:09:23,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:23,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:09:23,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:09:23,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,286 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:09:23,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:09:23,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:09:23,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:09:23,295 INFO L142 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size [2021-03-26 16:09:23,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:09:23,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:09:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:09:23,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:09:23,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2021-03-26 16:09:23,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363050015] [2021-03-26 16:09:23,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 16:09:23,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:09:23,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 16:09:23,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 16:09:23,307 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-26 16:09:23,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 1227 transitions, 34057 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:23,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:09:23,307 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-26 16:09:23,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:09:42,415 INFO L129 PetriNetUnfolder]: 20258/36898 cut-off events. [2021-03-26 16:09:42,415 INFO L130 PetriNetUnfolder]: For 2676808/2676814 co-relation queries the response was YES. [2021-03-26 16:09:42,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479224 conditions, 36898 events. 20258/36898 cut-off events. For 2676808/2676814 co-relation queries the response was YES. Maximal size of possible extension queue 2395. Compared 348638 event pairs, 1747 based on Foata normal form. 407/37305 useless extension candidates. Maximal degree in co-relation 479064. Up to 16952 conditions per place. [2021-03-26 16:09:43,130 INFO L132 encePairwiseOnDemand]: 41/54 looper letters, 1930 selfloop transitions, 531 changer transitions 59/2526 dead transitions. [2021-03-26 16:09:43,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 2526 transitions, 78399 flow [2021-03-26 16:09:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 16:09:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 16:09:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2021-03-26 16:09:43,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.39711934156378603 [2021-03-26 16:09:43,132 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 193 transitions. [2021-03-26 16:09:43,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 193 transitions. [2021-03-26 16:09:43,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:09:43,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 193 transitions. [2021-03-26 16:09:43,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.444444444444443) internal successors, (193), 9 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:43,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:43,133 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:09:43,133 INFO L185 Difference]: Start difference. First operand has 234 places, 1227 transitions, 34057 flow. Second operand 9 states and 193 transitions. [2021-03-26 16:09:43,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 2526 transitions, 78399 flow [2021-03-26 16:10:05,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 2526 transitions, 71414 flow, removed 3471 selfloop flow, removed 11 redundant places. [2021-03-26 16:10:05,543 INFO L241 Difference]: Finished difference. Result has 236 places, 1655 transitions, 44949 flow [2021-03-26 16:10:05,544 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=30113, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=44949, PETRI_PLACES=236, PETRI_TRANSITIONS=1655} [2021-03-26 16:10:05,545 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 213 predicate places. [2021-03-26 16:10:05,545 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:10:05,545 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 1655 transitions, 44949 flow [2021-03-26 16:10:05,545 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 1655 transitions, 44949 flow [2021-03-26 16:10:05,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 1655 transitions, 44949 flow [2021-03-26 16:10:13,756 INFO L129 PetriNetUnfolder]: 12047/25354 cut-off events. [2021-03-26 16:10:13,756 INFO L130 PetriNetUnfolder]: For 1783699/1800791 co-relation queries the response was YES. [2021-03-26 16:10:14,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 307467 conditions, 25354 events. 12047/25354 cut-off events. For 1783699/1800791 co-relation queries the response was YES. Maximal size of possible extension queue 1991. Compared 270306 event pairs, 914 based on Foata normal form. 2531/27423 useless extension candidates. Maximal degree in co-relation 307224. Up to 8458 conditions per place. [2021-03-26 16:10:14,684 INFO L142 LiptonReduction]: Number of co-enabled transitions 6496 [2021-03-26 16:10:15,041 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:10:15,041 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:10:15,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9496 [2021-03-26 16:10:15,042 INFO L480 AbstractCegarLoop]: Abstraction has has 227 places, 1655 transitions, 44949 flow [2021-03-26 16:10:15,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:10:15,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:10:15,042 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:10:15,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-03-26 16:10:15,242 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:10:15,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:10:15,243 INFO L82 PathProgramCache]: Analyzing trace with hash 515800734, now seen corresponding path program 1 times [2021-03-26 16:10:15,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:10:15,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7824616] [2021-03-26 16:10:15,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:10:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:10:15,259 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-26 16:10:15,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:10:15,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:10:15,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:10:15,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7824616] [2021-03-26 16:10:15,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491869761] [2021-03-26 16:10:15,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:10:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:10:15,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-26 16:10:15,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:10:15,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:10:15,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:10:15,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:10:15,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:10:15,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:10:15,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:10:15,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 16:10:15,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:10:15,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:10:15,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:10:15,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 16:10:15,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:10:15,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:10:15,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:10:15,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:10:15,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:10:15,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:10:15,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,315 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:10:15,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:10:15,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:10:15,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:10:15,320 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-26 16:10:15,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:10:15,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:10:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:10:15,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:10:15,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-26 16:10:15,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001281609] [2021-03-26 16:10:15,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 16:10:15,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:10:15,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 16:10:15,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 16:10:15,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 54 [2021-03-26 16:10:15,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 1655 transitions, 44949 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:10:15,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:10:15,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 54 [2021-03-26 16:10:15,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:10:41,339 INFO L129 PetriNetUnfolder]: 25973/45630 cut-off events. [2021-03-26 16:10:41,340 INFO L130 PetriNetUnfolder]: For 3125013/3125019 co-relation queries the response was YES. [2021-03-26 16:10:42,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 571842 conditions, 45630 events. 25973/45630 cut-off events. For 3125013/3125019 co-relation queries the response was YES. Maximal size of possible extension queue 2278. Compared 415771 event pairs, 2390 based on Foata normal form. 2060/47690 useless extension candidates. Maximal degree in co-relation 571676. Up to 29098 conditions per place. [2021-03-26 16:10:42,409 INFO L132 encePairwiseOnDemand]: 45/54 looper letters, 1598 selfloop transitions, 375 changer transitions 182/2162 dead transitions. [2021-03-26 16:10:42,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 2162 transitions, 64580 flow [2021-03-26 16:10:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 16:10:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 16:10:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2021-03-26 16:10:42,410 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2021-03-26 16:10:42,410 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 141 transitions. [2021-03-26 16:10:42,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 141 transitions. [2021-03-26 16:10:42,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:10:42,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 141 transitions. [2021-03-26 16:10:42,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:10:42,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:10:42,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:10:42,411 INFO L185 Difference]: Start difference. First operand has 227 places, 1655 transitions, 44949 flow. Second operand 6 states and 141 transitions. [2021-03-26 16:10:42,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 2162 transitions, 64580 flow [2021-03-26 16:11:06,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 2162 transitions, 61814 flow, removed 1370 selfloop flow, removed 10 redundant places. [2021-03-26 16:11:06,737 INFO L241 Difference]: Finished difference. Result has 217 places, 1810 transitions, 50598 flow [2021-03-26 16:11:06,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=40013, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=50598, PETRI_PLACES=217, PETRI_TRANSITIONS=1810} [2021-03-26 16:11:06,738 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 194 predicate places. [2021-03-26 16:11:06,738 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:11:06,739 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 1810 transitions, 50598 flow [2021-03-26 16:11:06,739 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 1810 transitions, 50598 flow [2021-03-26 16:11:06,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 215 places, 1810 transitions, 50598 flow [2021-03-26 16:11:16,789 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([86] L47-->L46-1: Formula: (and (= (+ (select v_C_8 v_l_10) v_csum_6) v_csum_5) (= (+ v_l_10 1) v_l_9)) InVars {csum=v_csum_6, l=v_l_10, C=v_C_8} OutVars{csum=v_csum_5, l=v_l_9, C=v_C_8} AuxVars[] AssignedVars[csum, l][1372], [Black: 464#(<= k i), 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 523#(<= N (+ i 1)), Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 285#true, Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), 48#true, Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 51#(<= (+ l 1) N), Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 442#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 465#(<= N i), 212#true, 986#(<= l i)]) [2021-03-26 16:11:16,789 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 16:11:16,789 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:11:16,789 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 16:11:16,789 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:11:17,692 INFO L129 PetriNetUnfolder]: 16142/33061 cut-off events. [2021-03-26 16:11:17,692 INFO L130 PetriNetUnfolder]: For 1900634/1913943 co-relation queries the response was YES. [2021-03-26 16:11:18,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 376275 conditions, 33061 events. 16142/33061 cut-off events. For 1900634/1913943 co-relation queries the response was YES. Maximal size of possible extension queue 2103. Compared 347710 event pairs, 917 based on Foata normal form. 1943/34293 useless extension candidates. Maximal degree in co-relation 374068. Up to 11119 conditions per place. [2021-03-26 16:11:18,945 INFO L142 LiptonReduction]: Number of co-enabled transitions 6798 [2021-03-26 16:11:19,369 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:11:19,369 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:11:19,369 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12631 [2021-03-26 16:11:19,369 INFO L480 AbstractCegarLoop]: Abstraction has has 215 places, 1810 transitions, 50598 flow [2021-03-26 16:11:19,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:11:19,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:11:19,370 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:11:19,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-03-26 16:11:19,572 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:11:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:11:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash 338591375, now seen corresponding path program 1 times [2021-03-26 16:11:19,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:11:19,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590852567] [2021-03-26 16:11:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:11:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:11:19,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:11:19,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:11:19,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590852567] [2021-03-26 16:11:19,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125164707] [2021-03-26 16:11:19,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:11:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:11:19,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 16:11:19,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:11:19,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:11:19,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:11:19,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:11:19,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:11:19,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:11:19,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:11:19,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:11:19,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:11:19,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:11:19,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:11:19,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:11:19,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 16:11:19,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:11:19,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:11:19,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:11:19,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:11:19,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 16:11:19,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 16:11:19,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:11:19,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:11:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 16:11:19,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:11:19,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-03-26 16:11:19,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553012376] [2021-03-26 16:11:19,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 16:11:19,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:11:19,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 16:11:19,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-26 16:11:19,680 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-26 16:11:19,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 1810 transitions, 50598 flow. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:11:19,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:11:19,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-26 16:11:19,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:11:48,262 INFO L129 PetriNetUnfolder]: 24827/46033 cut-off events. [2021-03-26 16:11:48,262 INFO L130 PetriNetUnfolder]: For 2730641/2730673 co-relation queries the response was YES. [2021-03-26 16:11:49,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551634 conditions, 46033 events. 24827/46033 cut-off events. For 2730641/2730673 co-relation queries the response was YES. Maximal size of possible extension queue 2477. Compared 448153 event pairs, 1150 based on Foata normal form. 1479/47512 useless extension candidates. Maximal degree in co-relation 547652. Up to 14377 conditions per place. [2021-03-26 16:11:49,264 INFO L132 encePairwiseOnDemand]: 44/54 looper letters, 1864 selfloop transitions, 1785 changer transitions 81/3736 dead transitions. [2021-03-26 16:11:49,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 3736 transitions, 113186 flow [2021-03-26 16:11:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-03-26 16:11:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-03-26 16:11:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 622 transitions. [2021-03-26 16:11:49,265 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.39719029374201786 [2021-03-26 16:11:49,265 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 622 transitions. [2021-03-26 16:11:49,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 622 transitions. [2021-03-26 16:11:49,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:11:49,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 622 transitions. [2021-03-26 16:11:49,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 21.448275862068964) internal successors, (622), 29 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:11:49,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 54.0) internal successors, (1620), 30 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:11:49,269 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 54.0) internal successors, (1620), 30 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:11:49,269 INFO L185 Difference]: Start difference. First operand has 215 places, 1810 transitions, 50598 flow. Second operand 29 states and 622 transitions. [2021-03-26 16:11:49,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 3736 transitions, 113186 flow [2021-03-26 16:12:07,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 3736 transitions, 110832 flow, removed 1172 selfloop flow, removed 3 redundant places. [2021-03-26 16:12:07,216 INFO L241 Difference]: Finished difference. Result has 260 places, 2721 transitions, 83656 flow [2021-03-26 16:12:07,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=46736, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=856, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=83656, PETRI_PLACES=260, PETRI_TRANSITIONS=2721} [2021-03-26 16:12:07,218 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 237 predicate places. [2021-03-26 16:12:07,218 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:12:07,218 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 2721 transitions, 83656 flow [2021-03-26 16:12:07,218 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 2721 transitions, 83656 flow [2021-03-26 16:12:07,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 260 places, 2721 transitions, 83656 flow [2021-03-26 16:12:21,997 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][309], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), 1552#(and (< i N) (<= i k)), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-26 16:12:21,997 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-26 16:12:21,997 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 16:12:21,997 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 16:12:21,997 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 16:12:21,998 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][351], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), 1040#(and (<= l i) (< l N)), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-26 16:12:21,998 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-26 16:12:21,998 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 16:12:22,023 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 16:12:22,023 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 16:12:22,876 INFO L129 PetriNetUnfolder]: 15704/33535 cut-off events. [2021-03-26 16:12:22,895 INFO L130 PetriNetUnfolder]: For 2189626/2204586 co-relation queries the response was YES. [2021-03-26 16:12:23,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402273 conditions, 33535 events. 15704/33535 cut-off events. For 2189626/2204586 co-relation queries the response was YES. Maximal size of possible extension queue 2044. Compared 364849 event pairs, 886 based on Foata normal form. 2221/35001 useless extension candidates. Maximal degree in co-relation 400191. Up to 10392 conditions per place. [2021-03-26 16:12:24,516 INFO L142 LiptonReduction]: Number of co-enabled transitions 9076 [2021-03-26 16:12:25,390 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:12:25,390 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:12:25,391 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18173 [2021-03-26 16:12:25,391 INFO L480 AbstractCegarLoop]: Abstraction has has 260 places, 2721 transitions, 83656 flow [2021-03-26 16:12:25,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:12:25,391 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:12:25,391 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:12:25,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-03-26 16:12:25,592 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:12:25,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:12:25,592 INFO L82 PathProgramCache]: Analyzing trace with hash -344641756, now seen corresponding path program 2 times [2021-03-26 16:12:25,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:12:25,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615343579] [2021-03-26 16:12:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:12:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:12:25,623 INFO L142 QuantifierPusher]: treesize reduction 7, result has 73.1 percent of original size [2021-03-26 16:12:25,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:12:25,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 16:12:25,657 INFO L142 QuantifierPusher]: treesize reduction 36, result has 56.1 percent of original size [2021-03-26 16:12:25,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:12:25,683 INFO L142 QuantifierPusher]: treesize reduction 55, result has 43.9 percent of original size [2021-03-26 16:12:25,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-26 16:12:25,707 INFO L142 QuantifierPusher]: treesize reduction 55, result has 45.0 percent of original size [2021-03-26 16:12:25,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:12:25,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:12:25,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:12:25,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:12:25,761 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:12:25,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:12:25,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615343579] [2021-03-26 16:12:25,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029084998] [2021-03-26 16:12:25,772 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:12:25,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-26 16:12:25,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:12:25,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 30 conjunts are in the unsatisfiable core [2021-03-26 16:12:25,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:12:25,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:12:25,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:12:25,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:12:25,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:12:25,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:12:25,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:12:25,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:12:25,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:12:25,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,818 INFO L147 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size 18 [2021-03-26 16:12:25,819 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size [2021-03-26 16:12:25,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:12:25,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:25,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:12:25,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:12:25,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:25,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:12:25,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:12:25,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:25,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:12:25,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:12:25,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:12:25,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:12:25,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:12:25,861 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:12:25,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:12:25,869 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:12:25,869 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2021-03-26 16:12:25,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:12:25,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:12:25,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,887 INFO L147 QuantifierPusher]: treesize reduction 2, result has 94.6 percent of original size 35 [2021-03-26 16:12:25,887 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.6 percent of original size [2021-03-26 16:12:25,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:12:25,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:12:25,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:12:25,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 16:12:25,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 16:12:25,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 16:12:25,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 16:12:25,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:25,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:12:25,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 16:12:25,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:25,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:12:25,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 16:12:25,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,931 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:25,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:12:25,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 16:12:25,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-03-26 16:12:25,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2021-03-26 16:12:25,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:12:25,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:12:25,937 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:12:25,947 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:12:25,948 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:12:25,948 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:46 [2021-03-26 16:12:25,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:12:25,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:12:25,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:12:25,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:12:25,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:12:25,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:12:25,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,982 INFO L147 QuantifierPusher]: treesize reduction 2, result has 95.9 percent of original size 47 [2021-03-26 16:12:25,983 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.0 percent of original size [2021-03-26 16:12:25,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:25,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:12:25,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 16:12:25,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:25,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:12:25,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 16:12:25,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-03-26 16:12:25,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-26 16:12:25,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2021-03-26 16:12:25,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:25,993 INFO L147 QuantifierPusher]: treesize reduction 1, result has 94.4 percent of original size 17 [2021-03-26 16:12:25,993 INFO L142 QuantifierPusher]: treesize reduction 1, result has 94.4 percent of original size [2021-03-26 16:12:25,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:12:25,993 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:12:26,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,001 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:12:26,002 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2021-03-26 16:12:26,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:12:26,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,033 INFO L147 QuantifierPusher]: treesize reduction 2, result has 91.3 percent of original size 21 [2021-03-26 16:12:26,034 INFO L142 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-03-26 16:12:26,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:26,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:12:26,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 16:12:26,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:26,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:12:26,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 16:12:26,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-03-26 16:12:26,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:12:26,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 16:12:26,043 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:12:26,047 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,049 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:12:26,049 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2021-03-26 16:12:26,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,071 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-26 16:12:26,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:12:26,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:12:26,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:12:26,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:12:26,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:12:26,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:12:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:12:26,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:12:26,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-03-26 16:12:26,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681064296] [2021-03-26 16:12:26,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-26 16:12:26,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:12:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-26 16:12:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-03-26 16:12:26,112 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-26 16:12:26,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 2721 transitions, 83656 flow. Second operand has 19 states, 19 states have (on average 15.421052631578947) internal successors, (293), 19 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:12:26,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:12:26,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-26 16:12:26,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:13:12,644 INFO L129 PetriNetUnfolder]: 25299/47224 cut-off events. [2021-03-26 16:13:12,644 INFO L130 PetriNetUnfolder]: For 3073819/3073833 co-relation queries the response was YES. [2021-03-26 16:13:13,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 599336 conditions, 47224 events. 25299/47224 cut-off events. For 3073819/3073833 co-relation queries the response was YES. Maximal size of possible extension queue 2554. Compared 464695 event pairs, 3917 based on Foata normal form. 15/47239 useless extension candidates. Maximal degree in co-relation 596195. Up to 40037 conditions per place. [2021-03-26 16:13:13,912 INFO L132 encePairwiseOnDemand]: 43/54 looper letters, 2776 selfloop transitions, 201 changer transitions 44/3027 dead transitions. [2021-03-26 16:13:13,912 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 3027 transitions, 97913 flow [2021-03-26 16:13:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-26 16:13:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-03-26 16:13:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 437 transitions. [2021-03-26 16:13:13,913 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.36784511784511786 [2021-03-26 16:13:13,913 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 437 transitions. [2021-03-26 16:13:13,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 437 transitions. [2021-03-26 16:13:13,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:13:13,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 437 transitions. [2021-03-26 16:13:13,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 19.863636363636363) internal successors, (437), 22 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:13:13,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 54.0) internal successors, (1242), 23 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:13:13,916 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 54.0) internal successors, (1242), 23 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:13:13,916 INFO L185 Difference]: Start difference. First operand has 260 places, 2721 transitions, 83656 flow. Second operand 22 states and 437 transitions. [2021-03-26 16:13:13,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 3027 transitions, 97913 flow [2021-03-26 16:13:42,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 3027 transitions, 90946 flow, removed 3480 selfloop flow, removed 2 redundant places. [2021-03-26 16:13:42,195 INFO L241 Difference]: Finished difference. Result has 291 places, 2858 transitions, 82275 flow [2021-03-26 16:13:42,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=77159, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=82275, PETRI_PLACES=291, PETRI_TRANSITIONS=2858} [2021-03-26 16:13:42,197 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 268 predicate places. [2021-03-26 16:13:42,197 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:13:42,197 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 2858 transitions, 82275 flow [2021-03-26 16:13:42,198 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 2858 transitions, 82275 flow [2021-03-26 16:13:42,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 289 places, 2858 transitions, 82275 flow [2021-03-26 16:13:57,959 INFO L129 PetriNetUnfolder]: 15980/34096 cut-off events. [2021-03-26 16:13:57,960 INFO L130 PetriNetUnfolder]: For 2055159/2068457 co-relation queries the response was YES. [2021-03-26 16:13:58,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391595 conditions, 34096 events. 15980/34096 cut-off events. For 2055159/2068457 co-relation queries the response was YES. Maximal size of possible extension queue 2099. Compared 372197 event pairs, 898 based on Foata normal form. 2200/35531 useless extension candidates. Maximal degree in co-relation 390085. Up to 8994 conditions per place. [2021-03-26 16:13:59,561 INFO L142 LiptonReduction]: Number of co-enabled transitions 9528 [2021-03-26 16:14:00,560 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:14:00,560 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:14:00,560 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18363 [2021-03-26 16:14:00,561 INFO L480 AbstractCegarLoop]: Abstraction has has 289 places, 2858 transitions, 82275 flow [2021-03-26 16:14:00,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 15.421052631578947) internal successors, (293), 19 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:14:00,561 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:14:00,561 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:14:00,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:14:00,762 INFO L428 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:14:00,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:14:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1740526560, now seen corresponding path program 3 times [2021-03-26 16:14:00,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:14:00,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990586309] [2021-03-26 16:14:00,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:14:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:14:00,786 INFO L142 QuantifierPusher]: treesize reduction 7, result has 73.1 percent of original size [2021-03-26 16:14:00,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:14:00,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 16:14:00,823 INFO L142 QuantifierPusher]: treesize reduction 34, result has 58.5 percent of original size [2021-03-26 16:14:00,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 16:14:00,870 INFO L142 QuantifierPusher]: treesize reduction 51, result has 49.0 percent of original size [2021-03-26 16:14:00,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 16:14:00,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:00,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:14:00,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:14:00,951 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:14:00,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:14:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:14:00,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990586309] [2021-03-26 16:14:00,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910228147] [2021-03-26 16:14:00,961 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:14:00,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-03-26 16:14:00,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:14:00,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 32 conjunts are in the unsatisfiable core [2021-03-26 16:14:00,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:14:00,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:14:00,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:14:00,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:14:00,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:14:00,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:14:00,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:14:00,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:14:00,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:14:00,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,992 INFO L147 QuantifierPusher]: treesize reduction 2, result has 90.9 percent of original size 20 [2021-03-26 16:14:00,992 INFO L142 QuantifierPusher]: treesize reduction 2, result has 90.9 percent of original size [2021-03-26 16:14:00,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:00,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:00,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:00,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:00,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:00,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:00,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:00,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:01,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:01,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:01,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:01,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:01,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:01,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:01,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:01,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:14:01,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:14:01,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:14:01,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:14:01,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 16:14:01,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:14:01,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 16:14:01,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:14:01,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:14:01,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:14:01,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:14:01,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,024 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:14:01,024 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:40 [2021-03-26 16:14:01,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,044 INFO L147 QuantifierPusher]: treesize reduction 6, result has 89.7 percent of original size 52 [2021-03-26 16:14:01,045 INFO L142 QuantifierPusher]: treesize reduction 6, result has 89.7 percent of original size [2021-03-26 16:14:01,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 16:14:01,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 16:14:01,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 16:14:01,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 16:14:01,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,069 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 16:14:01,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 16:14:01,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,075 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 16:14:01,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 16:14:01,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,109 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:14:01,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:14:01,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-26 16:14:01,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-26 16:14:01,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 16:14:01,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:14:01,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 16:14:01,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:14:01,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 16:14:01,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,121 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:14:01,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 16:14:01,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-26 16:14:01,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 16:14:01,125 INFO L446 ElimStorePlain]: Different costs {0=[v_C_82], 2=[A]} [2021-03-26 16:14:01,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-03-26 16:14:01,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 16:14:01,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 16:14:01,130 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:14:01,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,157 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-03-26 16:14:01,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 36 [2021-03-26 16:14:01,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:14:01,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:14:01,159 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-26 16:14:01,170 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:14:01,172 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:14:01,172 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:45 [2021-03-26 16:14:01,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:14:01,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:14:01,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 16:14:01,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 16:14:01,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 16:14:01,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 16:14:01,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 16:14:01,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 16:14:01,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2021-03-26 16:14:01,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:14:01,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:14:01,224 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:14:01,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:01,232 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:14:01,232 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:20 [2021-03-26 16:14:01,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:01,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:01,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:01,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:01,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:01,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:01,255 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-26 16:14:01,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 16:14:01,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:14:01,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:14:01,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:14:01,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:01,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:14:01,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:14:01,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:14:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:14:01,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:14:01,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-03-26 16:14:01,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590952072] [2021-03-26 16:14:01,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-26 16:14:01,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:14:01,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-26 16:14:01,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-03-26 16:14:01,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-26 16:14:01,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 2858 transitions, 82275 flow. Second operand has 16 states, 16 states have (on average 15.5625) internal successors, (249), 16 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:14:01,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:14:01,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-26 16:14:01,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:14:49,713 INFO L129 PetriNetUnfolder]: 25422/47481 cut-off events. [2021-03-26 16:14:49,713 INFO L130 PetriNetUnfolder]: For 2796014/2796028 co-relation queries the response was YES. [2021-03-26 16:14:50,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 575761 conditions, 47481 events. 25422/47481 cut-off events. For 2796014/2796028 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 468468 event pairs, 4116 based on Foata normal form. 16/47497 useless extension candidates. Maximal degree in co-relation 573820. Up to 40710 conditions per place. [2021-03-26 16:14:50,967 INFO L132 encePairwiseOnDemand]: 45/54 looper letters, 2845 selfloop transitions, 116 changer transitions 40/3007 dead transitions. [2021-03-26 16:14:50,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 3007 transitions, 91526 flow [2021-03-26 16:14:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-26 16:14:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-03-26 16:14:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 413 transitions. [2021-03-26 16:14:50,968 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.36419753086419754 [2021-03-26 16:14:50,968 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 413 transitions. [2021-03-26 16:14:50,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 413 transitions. [2021-03-26 16:14:50,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:14:50,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 413 transitions. [2021-03-26 16:14:50,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 19.666666666666668) internal successors, (413), 21 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:14:50,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 54.0) internal successors, (1188), 22 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:14:50,970 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 54.0) internal successors, (1188), 22 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:14:50,970 INFO L185 Difference]: Start difference. First operand has 289 places, 2858 transitions, 82275 flow. Second operand 21 states and 413 transitions. [2021-03-26 16:14:50,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 3007 transitions, 91526 flow [2021-03-26 16:15:17,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 3007 transitions, 90827 flow, removed 332 selfloop flow, removed 7 redundant places. [2021-03-26 16:15:17,717 INFO L241 Difference]: Finished difference. Result has 311 places, 2890 transitions, 82973 flow [2021-03-26 16:15:17,719 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=81578, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=82973, PETRI_PLACES=311, PETRI_TRANSITIONS=2890} [2021-03-26 16:15:17,719 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 288 predicate places. [2021-03-26 16:15:17,719 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:15:17,719 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 2890 transitions, 82973 flow [2021-03-26 16:15:17,720 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 2890 transitions, 82973 flow [2021-03-26 16:15:17,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 309 places, 2890 transitions, 82973 flow [2021-03-26 16:15:19,051 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][327], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1570#(and (< i N) (<= i l)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:15:19,051 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:15:19,051 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:15:19,051 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:15:19,051 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:15:19,052 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][366], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1570#(and (< i N) (<= i l)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:15:19,052 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:15:19,052 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:15:19,052 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:15:19,053 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:15:21,439 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][327], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:15:21,440 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:15:21,440 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:15:21,440 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:15:21,440 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:15:21,441 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][366], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:15:21,441 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:15:21,441 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:15:21,441 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:15:21,441 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:15:31,417 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][327], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:15:31,417 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 16:15:31,417 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:15:31,417 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:15:31,417 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:15:31,418 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][366], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:15:31,418 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 16:15:31,418 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:15:31,418 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:15:31,418 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:15:34,279 INFO L129 PetriNetUnfolder]: 16111/34186 cut-off events. [2021-03-26 16:15:34,279 INFO L130 PetriNetUnfolder]: For 2079411/2094176 co-relation queries the response was YES. [2021-03-26 16:15:35,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394629 conditions, 34186 events. 16111/34186 cut-off events. For 2079411/2094176 co-relation queries the response was YES. Maximal size of possible extension queue 2094. Compared 372128 event pairs, 923 based on Foata normal form. 2361/35777 useless extension candidates. Maximal degree in co-relation 393224. Up to 9037 conditions per place. [2021-03-26 16:15:36,066 INFO L142 LiptonReduction]: Number of co-enabled transitions 9654 [2021-03-26 16:15:37,214 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:15:37,214 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 16:15:37,214 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19495 [2021-03-26 16:15:37,214 INFO L480 AbstractCegarLoop]: Abstraction has has 309 places, 2890 transitions, 82973 flow [2021-03-26 16:15:37,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 15.5625) internal successors, (249), 16 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:15:37,215 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:15:37,215 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:15:37,415 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-03-26 16:15:37,415 INFO L428 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:15:37,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:15:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1751991650, now seen corresponding path program 4 times [2021-03-26 16:15:37,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:15:37,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564474008] [2021-03-26 16:15:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:15:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:15:37,447 INFO L142 QuantifierPusher]: treesize reduction 7, result has 73.1 percent of original size [2021-03-26 16:15:37,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 16:15:37,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:15:37,485 INFO L142 QuantifierPusher]: treesize reduction 39, result has 56.2 percent of original size [2021-03-26 16:15:37,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 16:15:37,507 INFO L142 QuantifierPusher]: treesize reduction 61, result has 46.5 percent of original size [2021-03-26 16:15:37,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 16:15:37,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:15:37,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:15:37,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:15:37,581 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:15:37,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:15:37,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564474008] [2021-03-26 16:15:37,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214409362] [2021-03-26 16:15:37,592 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:15:37,619 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-26 16:15:37,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:15:37,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 30 conjunts are in the unsatisfiable core [2021-03-26 16:15:37,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 16:15:37,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:15:37,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:15:37,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:15:37,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:15:37,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:15:37,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:15:37,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:15:37,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:15:37,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,638 INFO L147 QuantifierPusher]: treesize reduction 6, result has 76.9 percent of original size 20 [2021-03-26 16:15:37,639 INFO L142 QuantifierPusher]: treesize reduction 6, result has 76.9 percent of original size [2021-03-26 16:15:37,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:15:37,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:15:37,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:15:37,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:15:37,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:15:37,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 16:15:37,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:15:37,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:15:37,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:15:37,678 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:15:37,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:15:37,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:15:37,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 [2021-03-26 16:15:37,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:15:37,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:15:37,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:15:37,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:15:37,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:15:37,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:15:37,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,737 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:15:37,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:15:37,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:15:37,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:15:37,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:15:37,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:15:37,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-03-26 16:15:37,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 16:15:37,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 16:15:37,749 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:15:37,759 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,760 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:15:37,761 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:41 [2021-03-26 16:15:37,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,795 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-26 16:15:37,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 16:15:37,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:15:37,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:15:37,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 16:15:37,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 16:15:37,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:15:37,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:15:37,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,823 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:15:37,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 16:15:37,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-03-26 16:15:37,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 16:15:37,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 16:15:37,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:15:37,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,837 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.1 percent of original size [2021-03-26 16:15:37,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:15:37,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:15:37,837 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:27 [2021-03-26 16:15:37,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:15:37,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:15:37,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,861 INFO L147 QuantifierPusher]: treesize reduction 2, result has 92.9 percent of original size 26 [2021-03-26 16:15:37,861 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.1 percent of original size [2021-03-26 16:15:37,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:15:37,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:15:37,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:15:37,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:15:37,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-03-26 16:15:37,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:15:37,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:15:37,868 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:15:37,874 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:15:37,875 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:12 [2021-03-26 16:15:37,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:15:37,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:15:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:15:37,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:15:37,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-03-26 16:15:37,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021482095] [2021-03-26 16:15:37,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-26 16:15:37,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:15:37,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-26 16:15:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-03-26 16:15:37,911 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-26 16:15:37,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 2890 transitions, 82973 flow. Second operand has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 17 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:15:37,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:15:37,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-26 16:15:37,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:16:34,800 INFO L129 PetriNetUnfolder]: 26949/53057 cut-off events. [2021-03-26 16:16:34,801 INFO L130 PetriNetUnfolder]: For 3122826/3122840 co-relation queries the response was YES. [2021-03-26 16:16:36,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 633909 conditions, 53057 events. 26949/53057 cut-off events. For 3122826/3122840 co-relation queries the response was YES. Maximal size of possible extension queue 2895. Compared 561992 event pairs, 2303 based on Foata normal form. 19/53076 useless extension candidates. Maximal degree in co-relation 631846. Up to 22702 conditions per place. [2021-03-26 16:16:36,807 INFO L132 encePairwiseOnDemand]: 45/54 looper letters, 2860 selfloop transitions, 723 changer transitions 41/3630 dead transitions. [2021-03-26 16:16:36,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 3630 transitions, 112344 flow [2021-03-26 16:16:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-26 16:16:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-03-26 16:16:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 359 transitions. [2021-03-26 16:16:36,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.34990253411306044 [2021-03-26 16:16:36,809 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 359 transitions. [2021-03-26 16:16:36,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 359 transitions. [2021-03-26 16:16:36,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:16:36,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 359 transitions. [2021-03-26 16:16:36,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 18.894736842105264) internal successors, (359), 19 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:16:36,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 54.0) internal successors, (1080), 20 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:16:36,811 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 54.0) internal successors, (1080), 20 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:16:36,811 INFO L185 Difference]: Start difference. First operand has 309 places, 2890 transitions, 82973 flow. Second operand 19 states and 359 transitions. [2021-03-26 16:16:36,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 3630 transitions, 112344 flow [2021-03-26 16:17:10,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 3630 transitions, 111677 flow, removed 274 selfloop flow, removed 7 redundant places. [2021-03-26 16:17:10,930 INFO L241 Difference]: Finished difference. Result has 330 places, 3168 transitions, 93487 flow [2021-03-26 16:17:10,932 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=82450, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=487, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=93487, PETRI_PLACES=330, PETRI_TRANSITIONS=3168} [2021-03-26 16:17:10,932 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 307 predicate places. [2021-03-26 16:17:10,932 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:17:10,932 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 3168 transitions, 93487 flow [2021-03-26 16:17:10,933 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 3168 transitions, 93487 flow [2021-03-26 16:17:10,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 328 places, 3168 transitions, 93487 flow [2021-03-26 16:17:14,216 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][1772], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, 537#(<= k (+ i 1)), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:17:14,216 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:17:14,216 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:17:14,216 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:17:14,216 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:17:14,217 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][187], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 537#(<= k (+ i 1)), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:17:14,217 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:17:14,217 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:17:14,217 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:17:14,217 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:17:26,812 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][1772], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1393#(and (<= N l) (<= k l)), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), 633#(and (<= N i) (<= k i)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-26 16:17:26,812 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 16:17:26,812 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 16:17:26,812 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 16:17:26,812 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 16:17:26,813 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][187], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), 633#(and (<= N i) (<= k i)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-26 16:17:26,813 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 16:17:26,813 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 16:17:26,813 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 16:17:26,813 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 16:17:30,243 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][1772], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1393#(and (<= N l) (<= k l)), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:17:30,243 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 16:17:30,243 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:17:30,243 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:17:30,243 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:17:30,244 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][187], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1393#(and (<= N l) (<= k l)), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-26 16:17:30,244 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 16:17:30,244 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:17:30,244 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:17:30,244 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:17:30,609 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][1772], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), 1040#(and (<= l i) (< l N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 1339#(<= k (+ l 1)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), 633#(and (<= N i) (<= k i)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-26 16:17:30,609 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 16:17:30,609 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 16:17:30,609 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 16:17:30,609 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 16:17:30,610 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][187], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), 1040#(and (<= l i) (< l N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1222#(<= N k), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1469#(<= N k), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1339#(<= k (+ l 1)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), 633#(and (<= N i) (<= k i)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-26 16:17:30,610 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 16:17:30,610 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 16:17:30,610 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 16:17:30,610 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 16:17:35,089 INFO L129 PetriNetUnfolder]: 17158/38499 cut-off events. [2021-03-26 16:17:35,089 INFO L130 PetriNetUnfolder]: For 2540423/2559619 co-relation queries the response was YES. [2021-03-26 16:17:36,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448831 conditions, 38499 events. 17158/38499 cut-off events. For 2540423/2559619 co-relation queries the response was YES. Maximal size of possible extension queue 2562. Compared 447084 event pairs, 1004 based on Foata normal form. 3469/41206 useless extension candidates. Maximal degree in co-relation 448159. Up to 9912 conditions per place. [2021-03-26 16:17:37,408 INFO L142 LiptonReduction]: Number of co-enabled transitions 10432 [2021-03-26 16:17:40,763 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 16:17:40,763 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 16:17:40,763 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29831 [2021-03-26 16:17:40,764 INFO L480 AbstractCegarLoop]: Abstraction has has 327 places, 3167 transitions, 93511 flow [2021-03-26 16:17:40,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 17 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:17:40,764 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 16:17:40,764 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 16:17:40,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-03-26 16:17:40,965 INFO L428 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 16:17:40,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 16:17:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2099220898, now seen corresponding path program 5 times [2021-03-26 16:17:40,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 16:17:40,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900167750] [2021-03-26 16:17:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 16:17:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 16:17:41,008 INFO L142 QuantifierPusher]: treesize reduction 11, result has 66.7 percent of original size [2021-03-26 16:17:41,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 16:17:41,024 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size [2021-03-26 16:17:41,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 16:17:41,039 INFO L142 QuantifierPusher]: treesize reduction 46, result has 53.5 percent of original size [2021-03-26 16:17:41,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 16:17:41,070 INFO L142 QuantifierPusher]: treesize reduction 63, result has 45.7 percent of original size [2021-03-26 16:17:41,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 16:17:41,113 INFO L142 QuantifierPusher]: treesize reduction 63, result has 46.6 percent of original size [2021-03-26 16:17:41,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-26 16:17:41,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:17:41,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 16:17:41,197 INFO L142 QuantifierPusher]: treesize reduction 13, result has 64.9 percent of original size [2021-03-26 16:17:41,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 16:17:41,226 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-26 16:17:41,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:17:41,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900167750] [2021-03-26 16:17:41,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757416132] [2021-03-26 16:17:41,242 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-26 16:17:41,281 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-26 16:17:41,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 16:17:41,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 33 conjunts are in the unsatisfiable core [2021-03-26 16:17:41,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:17:41,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:17:41,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:17:41,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:17:41,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:17:41,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:17:41,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:17:41,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:17:41,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 16:17:41,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 16:17:41,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:17:41,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 16:17:41,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:17:41,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 16:17:41,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:17:41,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 16:17:41,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-26 16:17:41,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:17:41,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 16:17:41,331 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:17:41,341 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:17:41,342 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:17:41,342 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-03-26 16:17:41,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:17:41,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 16:17:41,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,367 INFO L147 QuantifierPusher]: treesize reduction 7, result has 84.4 percent of original size 38 [2021-03-26 16:17:41,368 INFO L142 QuantifierPusher]: treesize reduction 7, result has 84.8 percent of original size [2021-03-26 16:17:41,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:17:41,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:17:41,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:17:41,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:17:41,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:17:41,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:17:41,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 16:17:41,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,395 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:17:41,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 16:17:41,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,397 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:17:41,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 16:17:41,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 16:17:41,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 16:17:41,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-03-26 16:17:41,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2021-03-26 16:17:41,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 16:17:41,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 16:17:41,408 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:17:41,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:17:41,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:17:41,422 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:45 [2021-03-26 16:17:41,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:17:41,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:17:41,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:17:41,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:17:41,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:17:41,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:17:41,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-26 16:17:41,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:17:41,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:17:41,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,461 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 16:17:41,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 16:17:41,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-03-26 16:17:41,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:17:41,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 16:17:41,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:17:41,479 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:17:41,480 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:17:41,480 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:25 [2021-03-26 16:17:41,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:17:41,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 16:17:41,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,509 INFO L147 QuantifierPusher]: treesize reduction 2, result has 92.9 percent of original size 26 [2021-03-26 16:17:41,509 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.1 percent of original size [2021-03-26 16:17:41,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:17:41,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:17:41,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,512 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 16:17:41,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 16:17:41,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-03-26 16:17:41,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:17:41,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 16:17:41,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 16:17:41,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,527 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 16:17:41,527 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:12 [2021-03-26 16:17:41,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,555 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-26 16:17:41,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 16:17:41,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,555 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 16:17:41,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 16:17:41,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 16:17:41,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 16:17:41,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 16:17:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 16:17:41,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 16:17:41,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2021-03-26 16:17:41,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605025201] [2021-03-26 16:17:41,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-26 16:17:41,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 16:17:41,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-26 16:17:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-26 16:17:41,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2021-03-26 16:17:41,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 3167 transitions, 93511 flow. Second operand has 18 states, 18 states have (on average 15.5) internal successors, (279), 18 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:17:41,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 16:17:41,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2021-03-26 16:17:41,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 16:19:32,686 INFO L129 PetriNetUnfolder]: 37329/69100 cut-off events. [2021-03-26 16:19:32,687 INFO L130 PetriNetUnfolder]: For 4400868/4400882 co-relation queries the response was YES. [2021-03-26 16:19:35,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 853545 conditions, 69100 events. 37329/69100 cut-off events. For 4400868/4400882 co-relation queries the response was YES. Maximal size of possible extension queue 3669. Compared 710528 event pairs, 2704 based on Foata normal form. 18/69118 useless extension candidates. Maximal degree in co-relation 851976. Up to 30309 conditions per place. [2021-03-26 16:19:35,692 INFO L132 encePairwiseOnDemand]: 43/57 looper letters, 3706 selfloop transitions, 1043 changer transitions 19/4774 dead transitions. [2021-03-26 16:19:35,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 4774 transitions, 150719 flow [2021-03-26 16:19:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-26 16:19:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-03-26 16:19:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 364 transitions. [2021-03-26 16:19:35,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.35477582846003897 [2021-03-26 16:19:35,693 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 364 transitions. [2021-03-26 16:19:35,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 364 transitions. [2021-03-26 16:19:35,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 16:19:35,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 364 transitions. [2021-03-26 16:19:35,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 20.22222222222222) internal successors, (364), 18 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:19:35,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 57.0) internal successors, (1083), 19 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:19:35,695 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 57.0) internal successors, (1083), 19 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 16:19:35,695 INFO L185 Difference]: Start difference. First operand has 327 places, 3167 transitions, 93511 flow. Second operand 18 states and 364 transitions. [2021-03-26 16:19:35,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 4774 transitions, 150719 flow [2021-03-26 16:21:20,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 4774 transitions, 149645 flow, removed 520 selfloop flow, removed 9 redundant places. [2021-03-26 16:21:20,213 INFO L241 Difference]: Finished difference. Result has 345 places, 3780 transitions, 114524 flow [2021-03-26 16:21:20,216 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=92667, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=495, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=114524, PETRI_PLACES=345, PETRI_TRANSITIONS=3780} [2021-03-26 16:21:20,216 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 322 predicate places. [2021-03-26 16:21:20,216 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 16:21:20,216 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 3780 transitions, 114524 flow [2021-03-26 16:21:20,217 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 3780 transitions, 114524 flow [2021-03-26 16:21:20,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 345 places, 3780 transitions, 114524 flow [2021-03-26 16:21:21,853 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:21,854 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][3534], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 527#(<= k i), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 790#(<= k i), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 463#(<= (+ k 1) i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:21,854 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:21,854 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:21,854 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:22,284 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k))]) [2021-03-26 16:21:22,284 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:22,284 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:22,284 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:22,284 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-26 16:21:22,284 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][1681], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 527#(<= k i), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 790#(<= k i), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:22,284 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:22,284 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:22,284 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-26 16:21:22,284 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:22,284 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k))]) [2021-03-26 16:21:22,285 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:22,285 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:22,285 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:22,285 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-26 16:21:22,434 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][52], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-26 16:21:22,434 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 16:21:22,434 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:22,434 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:22,434 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:22,434 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k)), 1022#(< l N)]) [2021-03-26 16:21:22,434 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 16:21:22,434 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:22,434 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:22,434 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:22,435 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k)), 1022#(< l N)]) [2021-03-26 16:21:22,435 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 16:21:22,435 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:22,435 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:22,435 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:22,656 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:22,657 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:22,657 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:22,657 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:22,657 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:22,657 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:22,657 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:22,657 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:22,657 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:22,657 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,099 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][200], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 527#(<= k i), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 790#(<= k i), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 463#(<= (+ k 1) i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:23,099 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,099 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,099 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:23,099 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:23,099 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:23,099 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,100 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:23,100 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,100 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:23,100 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:23,100 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,100 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:23,100 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:23,100 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,256 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:23,256 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,256 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,256 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,256 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:23,257 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:23,257 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,257 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,257 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,257 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:23,276 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k))]) [2021-03-26 16:21:23,277 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][3126], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:23,277 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k))]) [2021-03-26 16:21:23,277 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:23,277 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 16:21:23,541 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:23,542 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,542 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:23,542 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,542 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,542 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,542 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:23,542 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,542 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:23,542 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,542 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,542 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:23,874 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][2359], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-26 16:21:23,875 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-26 16:21:23,875 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-26 16:21:23,875 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:23,997 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][1889], [Black: 464#(<= k i), Black: 465#(<= N i), 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 790#(<= k i), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 569#(and (<= k i) (<= N (+ i 1))), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:23,997 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:23,997 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:23,997 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 16:21:23,997 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:24,164 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][799], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1558#(and (<= N k) (< i N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-26 16:21:24,164 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2021-03-26 16:21:24,164 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 16:21:24,164 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 16:21:24,164 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 16:21:24,851 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:24,851 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:24,851 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:24,851 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:24,851 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:24,851 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][477], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:24,851 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:24,851 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:24,852 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:24,852 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:24,852 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:24,852 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:24,852 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:24,852 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:24,852 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:24,867 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:24,867 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:24,867 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:24,867 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:24,867 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:24,867 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][3328], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:24,867 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:24,867 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:24,867 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:24,868 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:24,868 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:24,868 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 16:21:24,868 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:24,868 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:24,868 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:25,028 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:25,028 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:25,028 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:25,028 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:25,028 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:25,028 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:25,028 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:25,028 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:25,028 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:25,028 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:25,036 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:25,036 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:25,036 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:25,036 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:25,036 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:25,037 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:25,037 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:25,037 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:25,037 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:25,037 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:25,053 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][1091], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1558#(and (<= N k) (< i N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:25,053 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 16:21:25,053 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:25,053 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 16:21:25,053 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:25,416 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 1288#(and (<= (+ l 1) k) (< l N)), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:25,416 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 16:21:25,416 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:25,416 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:25,416 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:21:25,630 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][717], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-26 16:21:25,631 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 16:21:25,631 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:21:25,631 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:25,631 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:25,657 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 1288#(and (<= (+ l 1) k) (< l N)), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:25,658 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-26 16:21:25,658 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 16:21:25,658 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-26 16:21:25,658 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-26 16:21:26,950 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][449], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 23#L23-1true, Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1558#(and (<= N k) (< i N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:26,950 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:26,951 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:26,951 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:26,951 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:26,954 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1570#(and (< i N) (<= i l)), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 48#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:26,954 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:26,954 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:26,954 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:26,954 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:26,955 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1570#(and (< i N) (<= i l)), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 48#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:26,955 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:26,955 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:26,955 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:26,955 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 16:21:26,957 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][1729], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 23#L23-1true, Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1222#(<= N k), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:26,957 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 16:21:26,957 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:26,957 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:26,957 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:27,778 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([99] L34-1-->thread2EXIT: Formula: (not (< v_k_22 v_N_15)) InVars {N=v_N_15, k=v_k_22} OutVars{N=v_N_15, k=v_k_22} AuxVars[] AssignedVars[][2421], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 1302#(and (<= N k) (< (+ l 1) N)), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1564#(and (<= i (+ l 1)) (<= N k)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:27,778 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 16:21:27,778 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:27,778 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:27,778 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:27,778 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), 1480#(<= i (+ l 1)), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:27,778 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 16:21:27,778 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:27,778 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:27,778 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:27,779 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][3624], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:27,779 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 16:21:27,779 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:27,779 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:27,779 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:27,779 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), 1480#(<= i (+ l 1)), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:27,779 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 16:21:27,779 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 16:21:27,779 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:27,779 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:28,193 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:28,194 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 16:21:28,194 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:21:28,194 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 16:21:28,194 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:21:28,508 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:28,508 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2021-03-26 16:21:28,508 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-26 16:21:28,508 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 16:21:28,508 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-26 16:21:31,362 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([99] L34-1-->thread2EXIT: Formula: (not (< v_k_22 v_N_15)) InVars {N=v_N_15, k=v_k_22} OutVars{N=v_N_15, k=v_k_22} AuxVars[] AssignedVars[][2421], [Black: 464#(<= k i), 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 523#(<= N (+ i 1)), 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 1302#(and (<= N k) (< (+ l 1) N)), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1564#(and (<= i (+ l 1)) (<= N k)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 465#(<= N i), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:31,363 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 16:21:31,363 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:31,363 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:31,363 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([99] L34-1-->thread2EXIT: Formula: (not (< v_k_22 v_N_15)) InVars {N=v_N_15, k=v_k_22} OutVars{N=v_N_15, k=v_k_22} AuxVars[] AssignedVars[][2421], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 1302#(and (<= N k) (< (+ l 1) N)), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1564#(and (<= i (+ l 1)) (<= N k)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:31,365 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), 1480#(<= i (+ l 1)), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:31,365 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), 1480#(<= i (+ l 1)), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:31,365 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 16:21:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:31,366 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 16:21:31,366 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:21:32,138 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:32,138 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 16:21:32,138 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 16:21:32,138 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:21:32,138 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:21:32,138 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:32,138 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 16:21:32,138 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 16:21:32,138 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 16:21:32,138 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:21:32,953 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:32,953 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 16:21:32,953 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:32,953 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:21:32,954 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:21:32,954 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:32,954 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 16:21:32,954 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:21:32,954 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:21:32,954 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:32,954 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][928], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 527#(<= k i), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 790#(<= k i), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 463#(<= (+ k 1) i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:32,954 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 16:21:32,954 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:21:32,954 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 16:21:32,954 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 16:21:34,432 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-26 16:21:34,433 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 16:21:34,433 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 16:21:34,433 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 16:21:34,433 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 16:21:34,433 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-26 16:21:34,433 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 16:21:34,433 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 16:21:34,433 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 16:21:34,433 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 16:21:35,130 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([99] L34-1-->thread2EXIT: Formula: (not (< v_k_22 v_N_15)) InVars {N=v_N_15, k=v_k_22} OutVars{N=v_N_15, k=v_k_22} AuxVars[] AssignedVars[][902], [Black: 464#(<= k i), 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 523#(<= N (+ i 1)), 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1296#(and (<= N k) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1564#(and (<= i (+ l 1)) (<= N k)), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 465#(<= N i), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-26 16:21:35,130 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 16:21:35,130 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 16:21:35,130 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 16:21:35,130 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 16:21:56,632 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1040#(and (<= l i) (< l N)), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-26 16:21:56,632 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 16:21:56,632 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 16:21:56,632 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 16:21:56,632 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 16:21:56,632 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][2837], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-26 16:21:56,632 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 16:21:56,632 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 16:21:56,633 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 16:21:56,633 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 16:21:56,633 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1040#(and (<= l i) (< l N)), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-26 16:21:56,633 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 16:21:56,633 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 16:21:56,633 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 16:21:56,633 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 16:21:59,510 INFO L129 PetriNetUnfolder]: 24289/50876 cut-off events. [2021-03-26 16:21:59,510 INFO L130 PetriNetUnfolder]: For 3541060/3564587 co-relation queries the response was YES. Received shutdown request... [2021-03-26 16:22:01,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620940 conditions, 50876 events. 24289/50876 cut-off events. For 3541060/3564587 co-relation queries the response was YES. Maximal size of possible extension queue 3134. Compared 577649 event pairs, 1379 based on Foata normal form. 5407/55261 useless extension candidates. Maximal degree in co-relation 620082. Up to 12964 conditions per place. [2021-03-26 16:22:02,825 INFO L142 LiptonReduction]: Number of co-enabled transitions 12254 [2021-03-26 16:22:02,860 WARN L222 SmtUtils]: Removed 1 from assertion stack [2021-03-26 16:22:03,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 16:22:03,061 WARN L545 AbstractCegarLoop]: Verification canceled [2021-03-26 16:22:03,065 WARN L224 ceAbstractionStarter]: Timeout [2021-03-26 16:22:03,065 INFO L202 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 04:22:03 BasicIcfg [2021-03-26 16:22:03,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 16:22:03,066 INFO L168 Benchmark]: Toolchain (without parser) took 800105.18 ms. Allocated memory was 255.9 MB in the beginning and 13.9 GB in the end (delta: 13.6 GB). Free memory was 236.4 MB in the beginning and 7.4 GB in the end (delta: -7.2 GB). Peak memory consumption was 8.6 GB. Max. memory is 16.0 GB. [2021-03-26 16:22:03,066 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 165.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 16:22:03,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.91 ms. Allocated memory is still 255.9 MB. Free memory was 236.4 MB in the beginning and 235.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 16:22:03,066 INFO L168 Benchmark]: Boogie Preprocessor took 14.21 ms. Allocated memory is still 255.9 MB. Free memory was 235.0 MB in the beginning and 233.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 16:22:03,066 INFO L168 Benchmark]: RCFGBuilder took 241.98 ms. Allocated memory is still 255.9 MB. Free memory was 233.8 MB in the beginning and 236.7 MB in the end (delta: -2.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.0 GB. [2021-03-26 16:22:03,066 INFO L168 Benchmark]: TraceAbstraction took 799823.19 ms. Allocated memory was 255.9 MB in the beginning and 13.9 GB in the end (delta: 13.6 GB). Free memory was 236.0 MB in the beginning and 7.4 GB in the end (delta: -7.2 GB). Peak memory consumption was 8.6 GB. Max. memory is 16.0 GB. [2021-03-26 16:22:03,066 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.16 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 165.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 21.91 ms. Allocated memory is still 255.9 MB. Free memory was 236.4 MB in the beginning and 235.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 14.21 ms. Allocated memory is still 255.9 MB. Free memory was 235.0 MB in the beginning and 233.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 241.98 ms. Allocated memory is still 255.9 MB. Free memory was 233.8 MB in the beginning and 236.7 MB in the end (delta: -2.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 799823.19 ms. Allocated memory was 255.9 MB in the beginning and 13.9 GB in the end (delta: 13.6 GB). Free memory was 236.0 MB in the beginning and 7.4 GB in the end (delta: -7.2 GB). Peak memory consumption was 8.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 188.0ms, 30 PlacesBefore, 23 PlacesAfterwards, 24 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.8ms, 22 PlacesBefore, 22 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 70, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.6ms, 30 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 70, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6ms, 35 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 70, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9ms, 31 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 70, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5ms, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 70, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.9ms, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 70, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.1ms, 56 PlacesBefore, 56 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 12 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 69, Positive conditional cache size: 1, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 143.6ms, 67 PlacesBefore, 66 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 72, positive conditional: 72, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, positive: 72, positive conditional: 52, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 72, positive conditional: 52, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 72, positive: 72, positive conditional: 52, positive unconditional: 20, 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): 73, Positive cache size: 69, Positive conditional cache size: 1, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 188.0ms, 70 PlacesBefore, 70 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 161 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, positive: 161, positive conditional: 161, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, positive: 161, positive conditional: 126, positive unconditional: 35, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, positive: 161, positive conditional: 126, positive unconditional: 35, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 161, positive: 161, positive conditional: 126, positive unconditional: 35, 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): 73, Positive cache size: 69, Positive conditional cache size: 1, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 91.3ms, 74 PlacesBefore, 74 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 24, positive conditional: 19, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 24, positive conditional: 19, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 24, positive: 24, positive conditional: 19, positive unconditional: 5, 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): 73, Positive cache size: 69, Positive conditional cache size: 1, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 141.0ms, 79 PlacesBefore, 79 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 57 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, positive: 57, positive conditional: 47, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 57, positive conditional: 47, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 57, positive: 53, positive conditional: 43, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.2ms, 85 PlacesBefore, 85 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.1ms, 95 PlacesBefore, 95 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.2ms, 104 PlacesBefore, 104 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 796 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.1ms, 110 PlacesBefore, 110 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 6, positive: 6, positive conditional: 6, 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 73.5ms, 121 PlacesBefore, 121 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 68.1ms, 125 PlacesBefore, 125 PlacesAfterwards, 152 TransitionsBefore, 152 TransitionsAfterwards, 1160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 73.5ms, 132 PlacesBefore, 132 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 1202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 98.8ms, 147 PlacesBefore, 147 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 1386 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 394.6ms, 185 PlacesBefore, 185 PlacesAfterwards, 369 TransitionsBefore, 369 TransitionsAfterwards, 2194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 679.0ms, 196 PlacesBefore, 195 PlacesAfterwards, 468 TransitionsBefore, 468 TransitionsAfterwards, 2422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1334.7ms, 199 PlacesBefore, 199 PlacesAfterwards, 605 TransitionsBefore, 605 TransitionsAfterwards, 3226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 77, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5346.1ms, 239 PlacesBefore, 234 PlacesAfterwards, 1227 TransitionsBefore, 1227 TransitionsAfterwards, 5012 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 76, Positive conditional cache size: 8, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9496.3ms, 236 PlacesBefore, 227 PlacesAfterwards, 1655 TransitionsBefore, 1655 TransitionsAfterwards, 6496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 80, Positive cache size: 76, Positive conditional cache size: 8, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12630.3ms, 217 PlacesBefore, 215 PlacesAfterwards, 1810 TransitionsBefore, 1810 TransitionsAfterwards, 6798 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 80, Positive cache size: 76, Positive conditional cache size: 8, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18172.3ms, 260 PlacesBefore, 260 PlacesAfterwards, 2721 TransitionsBefore, 2721 TransitionsAfterwards, 9076 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 80, Positive cache size: 76, Positive conditional cache size: 8, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18362.5ms, 291 PlacesBefore, 289 PlacesAfterwards, 2858 TransitionsBefore, 2858 TransitionsAfterwards, 9528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 80, Positive cache size: 76, Positive conditional cache size: 8, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19494.1ms, 311 PlacesBefore, 309 PlacesAfterwards, 2890 TransitionsBefore, 2890 TransitionsAfterwards, 9654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 80, Positive cache size: 76, Positive conditional cache size: 8, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29830.6ms, 330 PlacesBefore, 327 PlacesAfterwards, 3168 TransitionsBefore, 3167 TransitionsAfterwards, 10432 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 80, Positive cache size: 76, Positive conditional cache size: 8, Positive unconditional cache size: 68, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 68). Cancelled while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 345 places, 3780 transitions, 114524 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 345 places, 3780 transitions, 114524 flow and 12254 co-enabled transitions pairs.,while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 1ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 799724.4ms, OverallIterations: 30, TraceHistogramMax: 2, EmptinessCheckTime: 0.0ms, AutomataDifference: 627149.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 243.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 263 SDtfs, 1290 SDslu, 205 SDs, 0 SdLazy, 8395 SolverSat, 557 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3946.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 315 SyntacticMatches, 13 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 5248.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=114524occurred in iteration=30, InterpolantAutomatonStates: 326, 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: 131.2ms SsaConstructionTime, 485.8ms SatisfiabilityAnalysisTime, 6048.4ms InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 855 ConstructedInterpolants, 1 QuantifiedInterpolants, 9899 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1635 ConjunctsInSsa, 360 ConjunctsInUnsatCore, 55 InterpolantComputations, 5 PerfectInterpolantSequences, 79/267 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