/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 05:54:43,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 05:54:43,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 05:54:43,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 05:54:43,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 05:54:43,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 05:54:43,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 05:54:43,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 05:54:44,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 05:54:44,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 05:54:44,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 05:54:44,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 05:54:44,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 05:54:44,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 05:54:44,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 05:54:44,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 05:54:44,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 05:54:44,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 05:54:44,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 05:54:44,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 05:54:44,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 05:54:44,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 05:54:44,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 05:54:44,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 05:54:44,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 05:54:44,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 05:54:44,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 05:54:44,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 05:54:44,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 05:54:44,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 05:54:44,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 05:54:44,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 05:54:44,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 05:54:44,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 05:54:44,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 05:54:44,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 05:54:44,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 05:54:44,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 05:54:44,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 05:54:44,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 05:54:44,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 05:54:44,044 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 05:54:44,081 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 05:54:44,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 05:54:44,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 05:54:44,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 05:54:44,086 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 05:54:44,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 05:54:44,086 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 05:54:44,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 05:54:44,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 05:54:44,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 05:54:44,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 05:54:44,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 05:54:44,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 05:54:44,088 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 05:54:44,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 05:54:44,088 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 05:54:44,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 05:54:44,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 05:54:44,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 05:54:44,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 05:54:44,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 05:54:44,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 05:54:44,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 05:54:44,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 05:54:44,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 05:54:44,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 05:54:44,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 05:54:44,090 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 05:54:44,090 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 05:54:44,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 05:54:44,090 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 05:54:44,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 05:54:44,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 05:54:44,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 05:54:44,371 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-26 05:54:44,372 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-26 05:54:44,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl [2021-03-26 05:54:44,373 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl' [2021-03-26 05:54:44,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 05:54:44,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-26 05:54:44,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 05:54:44,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 05:54:44,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 05:54:44,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/1) ... [2021-03-26 05:54:44,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/1) ... [2021-03-26 05:54:44,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 05:54:44,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 05:54:44,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 05:54:44,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 05:54:44,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/1) ... [2021-03-26 05:54:44,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/1) ... [2021-03-26 05:54:44,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/1) ... [2021-03-26 05:54:44,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/1) ... [2021-03-26 05:54:44,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/1) ... [2021-03-26 05:54:44,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/1) ... [2021-03-26 05:54:44,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/1) ... [2021-03-26 05:54:44,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 05:54:44,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 05:54:44,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 05:54:44,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 05:54:44,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (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 05:54:44,520 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-26 05:54:44,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-26 05:54:44,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-26 05:54:44,520 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-26 05:54:44,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-26 05:54:44,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-26 05:54:44,521 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-26 05:54:44,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 05:54:44,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 05:54:44,521 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-26 05:54:44,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-26 05:54:44,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-26 05:54:44,521 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-03-26 05:54:44,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-03-26 05:54:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-03-26 05:54:44,522 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-03-26 05:54:44,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-03-26 05:54:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-03-26 05:54:44,523 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 05:54:44,695 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 05:54:44,695 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-26 05:54:44,697 INFO L202 PluginConnector]: Adding new model min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 05:54:44 BoogieIcfgContainer [2021-03-26 05:54:44,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 05:54:44,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 05:54:44,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 05:54:44,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 05:54:44,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 05:54:44" (1/2) ... [2021-03-26 05:54:44,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7781e5d4 and model type min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 05:54:44, skipping insertion in model container [2021-03-26 05:54:44,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 05:54:44" (2/2) ... [2021-03-26 05:54:44,703 INFO L111 eAbstractionObserver]: Analyzing ICFG min-max-inc-dec.wvr.bpl [2021-03-26 05:54:44,707 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 05:54:44,710 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 05:54:44,711 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 05:54:44,757 INFO L149 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2021-03-26 05:54:44,772 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 05:54:44,788 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 05:54:44,788 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 05:54:44,788 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 05:54:44,788 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 05:54:44,789 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 05:54:44,789 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 05:54:44,789 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 05:54:44,789 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 05:54:44,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 42 transitions, 124 flow [2021-03-26 05:54:44,833 INFO L129 PetriNetUnfolder]: 4/37 cut-off events. [2021-03-26 05:54:44,834 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 05:54:44,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 37 events. 4/37 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 81 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2021-03-26 05:54:44,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 42 transitions, 124 flow [2021-03-26 05:54:44,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 35 transitions, 100 flow [2021-03-26 05:54:44,843 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:44,862 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 100 flow [2021-03-26 05:54:44,865 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 100 flow [2021-03-26 05:54:44,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 100 flow [2021-03-26 05:54:44,885 INFO L129 PetriNetUnfolder]: 4/35 cut-off events. [2021-03-26 05:54:44,886 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 05:54:44,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 4/35 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 78 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2021-03-26 05:54:44,894 INFO L142 LiptonReduction]: Number of co-enabled transitions 552 [2021-03-26 05:54:45,226 INFO L154 LiptonReduction]: Checked pairs total: 216 [2021-03-26 05:54:45,226 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 05:54:45,228 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 386 [2021-03-26 05:54:45,268 INFO L129 PetriNetUnfolder]: 4/24 cut-off events. [2021-03-26 05:54:45,268 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 05:54:45,268 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:45,269 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:45,269 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:45,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1547649520, now seen corresponding path program 1 times [2021-03-26 05:54:45,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:45,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83074765] [2021-03-26 05:54:45,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:45,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:45,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-26 05:54:45,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:45,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:45,413 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 05:54:45,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83074765] [2021-03-26 05:54:45,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 05:54:45,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 05:54:45,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814356168] [2021-03-26 05:54:45,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 05:54:45,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:45,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 05:54:45,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 05:54:45,433 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 52 [2021-03-26 05:54:45,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:45,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 52 [2021-03-26 05:54:45,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:45,464 INFO L129 PetriNetUnfolder]: 5/34 cut-off events. [2021-03-26 05:54:45,464 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 05:54:45,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 34 events. 5/34 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2021-03-26 05:54:45,466 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 2 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2021-03-26 05:54:45,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 96 flow [2021-03-26 05:54:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 05:54:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 05:54:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2021-03-26 05:54:45,476 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2021-03-26 05:54:45,477 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 232 transitions. [2021-03-26 05:54:45,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 232 transitions. [2021-03-26 05:54:45,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:45,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 232 transitions. [2021-03-26 05:54:45,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,489 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 80 flow. Second operand 5 states and 232 transitions. [2021-03-26 05:54:45,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 96 flow [2021-03-26 05:54:45,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 76 flow, removed 0 selfloop flow, removed 10 redundant places. [2021-03-26 05:54:45,494 INFO L241 Difference]: Finished difference. Result has 33 places, 27 transitions, 80 flow [2021-03-26 05:54:45,495 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2021-03-26 05:54:45,496 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2021-03-26 05:54:45,496 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:45,496 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 80 flow [2021-03-26 05:54:45,497 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 80 flow [2021-03-26 05:54:45,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 80 flow [2021-03-26 05:54:45,504 INFO L129 PetriNetUnfolder]: 5/34 cut-off events. [2021-03-26 05:54:45,504 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 05:54:45,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 34 events. 5/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2021-03-26 05:54:45,505 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-26 05:54:45,507 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:45,508 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:45,508 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-26 05:54:45,509 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 80 flow [2021-03-26 05:54:45,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,509 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:45,510 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:45,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 05:54:45,510 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1943799234, now seen corresponding path program 2 times [2021-03-26 05:54:45,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:45,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478783959] [2021-03-26 05:54:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:45,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:45,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-26 05:54:45,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:45,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:45,548 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 05:54:45,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478783959] [2021-03-26 05:54:45,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 05:54:45,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 05:54:45,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242508611] [2021-03-26 05:54:45,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 05:54:45,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 05:54:45,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 05:54:45,552 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 52 [2021-03-26 05:54:45,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:45,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 52 [2021-03-26 05:54:45,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:45,573 INFO L129 PetriNetUnfolder]: 8/54 cut-off events. [2021-03-26 05:54:45,573 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-26 05:54:45,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 54 events. 8/54 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 0 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 59. Up to 6 conditions per place. [2021-03-26 05:54:45,574 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 3 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2021-03-26 05:54:45,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 107 flow [2021-03-26 05:54:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 05:54:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 05:54:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2021-03-26 05:54:45,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2021-03-26 05:54:45,577 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 232 transitions. [2021-03-26 05:54:45,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 232 transitions. [2021-03-26 05:54:45,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:45,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 232 transitions. [2021-03-26 05:54:45,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,580 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,580 INFO L185 Difference]: Start difference. First operand has 33 places, 27 transitions, 80 flow. Second operand 5 states and 232 transitions. [2021-03-26 05:54:45,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 107 flow [2021-03-26 05:54:45,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 05:54:45,582 INFO L241 Difference]: Finished difference. Result has 38 places, 30 transitions, 110 flow [2021-03-26 05:54:45,582 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2021-03-26 05:54:45,583 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2021-03-26 05:54:45,583 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:45,583 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 110 flow [2021-03-26 05:54:45,584 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 110 flow [2021-03-26 05:54:45,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 110 flow [2021-03-26 05:54:45,592 INFO L129 PetriNetUnfolder]: 8/54 cut-off events. [2021-03-26 05:54:45,593 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 05:54:45,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 54 events. 8/54 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2021-03-26 05:54:45,594 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-26 05:54:45,596 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:45,596 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:45,597 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 05:54:45,598 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 110 flow [2021-03-26 05:54:45,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,598 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:45,598 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:45,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 05:54:45,598 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1128265854, now seen corresponding path program 3 times [2021-03-26 05:54:45,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:45,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781880019] [2021-03-26 05:54:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:45,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:45,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:45,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:45,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:45,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:45,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:45,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:45,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:45,644 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 05:54:45,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781880019] [2021-03-26 05:54:45,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 05:54:45,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 05:54:45,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116370480] [2021-03-26 05:54:45,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 05:54:45,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:45,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 05:54:45,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 05:54:45,647 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 52 [2021-03-26 05:54:45,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:45,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 52 [2021-03-26 05:54:45,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:45,717 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][32], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 22#L38true, 8#L51-1true, 72#(and v_assert (not b2)), Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0))]) [2021-03-26 05:54:45,718 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,718 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,718 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,718 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,720 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][31], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 19#thread2ENTRYtrue, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true]) [2021-03-26 05:54:45,720 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,720 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:45,720 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,720 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:45,721 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][31], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 19#thread2ENTRYtrue, 4#thread5EXITtrue, 8#L51-1true, 72#(and v_assert (not b2)), Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true]) [2021-03-26 05:54:45,721 INFO L384 tUnfolder$Statistics]: this new event has 9 ancestors and is not cut-off event [2021-03-26 05:54:45,721 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-03-26 05:54:45,721 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:45,721 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-03-26 05:54:45,721 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:45,722 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][32], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 22#L38true, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true]) [2021-03-26 05:54:45,722 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2021-03-26 05:54:45,722 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,722 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,722 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,722 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,731 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 21#L40-1true, 26#thread1ENTRYtrue, 63#(and v_assert (not b1))]) [2021-03-26 05:54:45,731 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,731 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:45,731 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:45,731 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,753 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][37], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true]) [2021-03-26 05:54:45,754 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,754 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,754 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,754 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,755 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][32], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 22#L38true, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0))]) [2021-03-26 05:54:45,755 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,755 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,755 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,755 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,755 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:45,755 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,757 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 46#L25true, 14#L62-1true, 21#L40-1true, 63#(and v_assert (not b1))]) [2021-03-26 05:54:45,757 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,757 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,757 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,758 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,758 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true]) [2021-03-26 05:54:45,758 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,758 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,758 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,758 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,778 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 21#L40-1true, 26#thread1ENTRYtrue, 63#(and v_assert (not b1))]) [2021-03-26 05:54:45,779 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2021-03-26 05:54:45,779 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-03-26 05:54:45,779 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-03-26 05:54:45,779 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:45,779 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:45,781 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 46#L25true, 21#L40-1true, 63#(and v_assert (not b1))]) [2021-03-26 05:54:45,782 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,782 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,783 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,785 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,786 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,788 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true]) [2021-03-26 05:54:45,788 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:45,792 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,792 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,792 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,792 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,792 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][37], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0))]) [2021-03-26 05:54:45,793 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,793 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,793 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,793 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,793 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,793 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][37], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true]) [2021-03-26 05:54:45,793 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2021-03-26 05:54:45,793 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:45,794 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:45,794 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:45,794 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:45,794 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:45,794 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true]) [2021-03-26 05:54:45,794 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,794 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,794 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,794 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,794 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,795 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:45,824 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true]) [2021-03-26 05:54:45,825 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:45,825 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,825 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,825 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,825 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,825 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:45,825 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,839 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][52], [Black: 60#(not b1), 33#thread5ENTRYtrue, Black: 61#v_assert, 67#true, 20#L85true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0))]) [2021-03-26 05:54:45,840 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2021-03-26 05:54:45,840 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:45,840 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:45,840 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:45,855 INFO L129 PetriNetUnfolder]: 299/609 cut-off events. [2021-03-26 05:54:45,856 INFO L130 PetriNetUnfolder]: For 237/279 co-relation queries the response was YES. [2021-03-26 05:54:45,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 609 events. 299/609 cut-off events. For 237/279 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3106 event pairs, 16 based on Foata normal form. 5/595 useless extension candidates. Maximal degree in co-relation 1025. Up to 203 conditions per place. [2021-03-26 05:54:45,862 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 15 selfloop transitions, 11 changer transitions 30/72 dead transitions. [2021-03-26 05:54:45,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 366 flow [2021-03-26 05:54:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 05:54:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 05:54:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 370 transitions. [2021-03-26 05:54:45,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7905982905982906 [2021-03-26 05:54:45,867 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 370 transitions. [2021-03-26 05:54:45,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 370 transitions. [2021-03-26 05:54:45,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:45,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 370 transitions. [2021-03-26 05:54:45,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 41.111111111111114) internal successors, (370), 9 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,872 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,872 INFO L185 Difference]: Start difference. First operand has 38 places, 30 transitions, 110 flow. Second operand 9 states and 370 transitions. [2021-03-26 05:54:45,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 366 flow [2021-03-26 05:54:45,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 05:54:45,877 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 184 flow [2021-03-26 05:54:45,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2021-03-26 05:54:45,877 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2021-03-26 05:54:45,877 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:45,877 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 184 flow [2021-03-26 05:54:45,880 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 184 flow [2021-03-26 05:54:45,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 184 flow [2021-03-26 05:54:45,890 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][15], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:45,891 INFO L384 tUnfolder$Statistics]: this new event has 9 ancestors and is not cut-off event [2021-03-26 05:54:45,891 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-03-26 05:54:45,892 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:45,892 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-03-26 05:54:45,892 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][15], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:45,893 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,893 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:45,893 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:45,893 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:45,893 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-26 05:54:45,894 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:45,894 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,894 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,894 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,894 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,894 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:45,894 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,895 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,895 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,895 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,895 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,896 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:45,896 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,896 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,896 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,896 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,897 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:45,897 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2021-03-26 05:54:45,897 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:45,897 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:45,898 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:45,898 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:45,898 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:45,898 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:45,898 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-03-26 05:54:45,898 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:45,899 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:45,899 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:45,899 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:45,900 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:45,900 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:45,900 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,900 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,900 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:45,900 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,900 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:45,901 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][34], [Black: 79#(= min max), 33#thread5ENTRYtrue, Black: 60#(not b1), Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0)), 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:45,901 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2021-03-26 05:54:45,901 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:45,901 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:45,901 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:45,901 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][34], [Black: 79#(= min max), 33#thread5ENTRYtrue, Black: 60#(not b1), Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:45,901 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-26 05:54:45,901 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 05:54:45,902 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 05:54:45,902 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:45,906 INFO L129 PetriNetUnfolder]: 98/189 cut-off events. [2021-03-26 05:54:45,907 INFO L130 PetriNetUnfolder]: For 385/394 co-relation queries the response was YES. [2021-03-26 05:54:45,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 189 events. 98/189 cut-off events. For 385/394 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 686 event pairs, 5 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 582. Up to 82 conditions per place. [2021-03-26 05:54:45,914 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 05:54:45,920 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:45,921 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:45,921 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-26 05:54:45,927 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 184 flow [2021-03-26 05:54:45,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:45,927 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:45,927 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:45,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 05:54:45,928 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1488375128, now seen corresponding path program 4 times [2021-03-26 05:54:45,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:45,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451684563] [2021-03-26 05:54:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:46,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:46,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:46,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,024 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 05:54:46,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451684563] [2021-03-26 05:54:46,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 05:54:46,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 05:54:46,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713515806] [2021-03-26 05:54:46,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 05:54:46,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:46,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 05:54:46,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 05:54:46,027 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 52 [2021-03-26 05:54:46,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:46,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:46,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 52 [2021-03-26 05:54:46,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:46,110 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,110 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,110 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:46,110 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:46,110 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,113 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,113 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,113 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,113 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,113 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,115 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 22#L38true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:46,115 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,115 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,115 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,115 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,116 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,116 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,116 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,116 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,116 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,116 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,124 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,124 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2021-03-26 05:54:46,124 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:46,124 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-03-26 05:54:46,124 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-03-26 05:54:46,124 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:46,125 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 22#L38true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:46,125 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,125 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,125 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,125 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,125 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,126 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,127 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,127 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,127 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,127 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,127 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,127 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,128 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,128 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:46,128 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,128 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,128 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,128 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,128 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,128 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,129 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:46,129 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,129 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,129 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,129 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,130 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][48], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, Black: 61#v_assert, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,130 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,131 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,131 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,131 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,144 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, 72#(and v_assert (not b2)), Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 22#L38true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,144 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,144 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,144 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,144 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,145 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,145 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:46,145 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,145 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,145 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,145 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:46,146 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,146 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,146 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,146 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][53], [Black: 79#(= min max), 33#thread5ENTRYtrue, 97#true, Black: 60#(not b1), Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0)), 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:46,146 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 05:54:46,146 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 05:54:46,146 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 05:54:46,146 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:54:46,147 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:46,147 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,147 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,147 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,147 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,147 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,148 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][48], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, Black: 61#v_assert, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,148 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,148 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,148 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,148 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,148 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,148 INFO L382 tUnfolder$Statistics]: inserting event number 9 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,149 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,149 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,149 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:46,149 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,149 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,149 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:46,149 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,149 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,149 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,158 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][53], [Black: 79#(= min max), 33#thread5ENTRYtrue, Black: 60#(not b1), 97#true, Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0)), 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-03-26 05:54:46,159 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-26 05:54:46,159 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:46,159 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 05:54:46,159 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:46,159 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 05:54:46,165 INFO L129 PetriNetUnfolder]: 218/394 cut-off events. [2021-03-26 05:54:46,165 INFO L130 PetriNetUnfolder]: For 1157/1249 co-relation queries the response was YES. [2021-03-26 05:54:46,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 394 events. 218/394 cut-off events. For 1157/1249 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1583 event pairs, 14 based on Foata normal form. 11/395 useless extension candidates. Maximal degree in co-relation 1521. Up to 192 conditions per place. [2021-03-26 05:54:46,170 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 21 selfloop transitions, 15 changer transitions 23/75 dead transitions. [2021-03-26 05:54:46,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 619 flow [2021-03-26 05:54:46,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 05:54:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 05:54:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 370 transitions. [2021-03-26 05:54:46,172 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7905982905982906 [2021-03-26 05:54:46,172 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 370 transitions. [2021-03-26 05:54:46,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 370 transitions. [2021-03-26 05:54:46,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:46,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 370 transitions. [2021-03-26 05:54:46,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 41.111111111111114) internal successors, (370), 9 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:46,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:46,175 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:46,176 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 184 flow. Second operand 9 states and 370 transitions. [2021-03-26 05:54:46,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 619 flow [2021-03-26 05:54:46,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 553 flow, removed 32 selfloop flow, removed 6 redundant places. [2021-03-26 05:54:46,184 INFO L241 Difference]: Finished difference. Result has 54 places, 46 transitions, 321 flow [2021-03-26 05:54:46,184 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=321, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2021-03-26 05:54:46,185 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2021-03-26 05:54:46,185 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:46,185 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 321 flow [2021-03-26 05:54:46,185 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 46 transitions, 321 flow [2021-03-26 05:54:46,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 321 flow [2021-03-26 05:54:46,199 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,199 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,199 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,199 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,199 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,200 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][5], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 19#thread2ENTRYtrue, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,201 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2021-03-26 05:54:46,201 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,201 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:46,201 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:46,201 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][5], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 19#thread2ENTRYtrue, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,201 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,201 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:46,202 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:46,202 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:46,202 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:46,202 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,203 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,203 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,203 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,203 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,203 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,204 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,204 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,204 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,204 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,204 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,204 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,204 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,206 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,207 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:46,207 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,207 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,207 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,207 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,207 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,207 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,207 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,208 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,208 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,208 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,208 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,209 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-03-26 05:54:46,209 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,209 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,209 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,209 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:46,210 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][5], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 22#L38true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,210 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,210 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,210 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,210 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,211 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,211 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:46,211 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,211 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,211 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,211 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:46,211 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,211 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,211 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:46,212 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,212 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,212 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,212 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,212 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,212 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,213 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-03-26 05:54:46,213 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,213 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,213 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,213 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,213 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:46,214 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][40], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 33#thread5ENTRYtrue, 8#L51-1true, Black: 69#(not b2), 14#L62-1true, 78#(= max (select A 0)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 20#L85true, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-03-26 05:54:46,214 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 05:54:46,214 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 05:54:46,214 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 05:54:46,214 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:54:46,214 INFO L382 tUnfolder$Statistics]: inserting event number 9 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-03-26 05:54:46,214 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,215 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,215 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-26 05:54:46,215 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,215 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,215 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-26 05:54:46,215 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,215 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,215 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-26 05:54:46,216 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][40], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 33#thread5ENTRYtrue, 8#L51-1true, Black: 69#(not b2), 78#(= max (select A 0)), 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 20#L85true, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-03-26 05:54:46,216 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-26 05:54:46,216 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:46,216 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-26 05:54:46,216 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 05:54:46,216 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-26 05:54:46,219 INFO L129 PetriNetUnfolder]: 158/299 cut-off events. [2021-03-26 05:54:46,220 INFO L130 PetriNetUnfolder]: For 1050/1107 co-relation queries the response was YES. [2021-03-26 05:54:46,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 299 events. 158/299 cut-off events. For 1050/1107 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1204 event pairs, 6 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 1180. Up to 132 conditions per place. [2021-03-26 05:54:46,226 INFO L142 LiptonReduction]: Number of co-enabled transitions 552 [2021-03-26 05:54:46,231 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:46,231 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:46,231 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 46 [2021-03-26 05:54:46,233 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 321 flow [2021-03-26 05:54:46,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:46,233 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:46,233 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:46,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 05:54:46,234 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1773407713, now seen corresponding path program 1 times [2021-03-26 05:54:46,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:46,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191722467] [2021-03-26 05:54:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:46,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,328 INFO L142 QuantifierPusher]: treesize reduction 24, result has 59.3 percent of original size [2021-03-26 05:54:46,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 05:54:46,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:46,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 05:54:46,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191722467] [2021-03-26 05:54:46,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511803012] [2021-03-26 05:54:46,367 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 05:54:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:46,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2021-03-26 05:54:46,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:54:46,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:46,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:46,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:54:46,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:46,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:46,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:54:46,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:46,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:46,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 05:54:46,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:54:46,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 8 [2021-03-26 05:54:46,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007763150] [2021-03-26 05:54:46,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 05:54:46,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 05:54:46,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-03-26 05:54:46,560 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2021-03-26 05:54:46,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 321 flow. Second operand has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:46,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:46,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2021-03-26 05:54:46,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:47,720 INFO L129 PetriNetUnfolder]: 4318/5895 cut-off events. [2021-03-26 05:54:47,720 INFO L130 PetriNetUnfolder]: For 28927/29143 co-relation queries the response was YES. [2021-03-26 05:54:47,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26512 conditions, 5895 events. 4318/5895 cut-off events. For 28927/29143 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 29947 event pairs, 228 based on Foata normal form. 167/6046 useless extension candidates. Maximal degree in co-relation 26423. Up to 2333 conditions per place. [2021-03-26 05:54:47,775 INFO L132 encePairwiseOnDemand]: 42/52 looper letters, 94 selfloop transitions, 42 changer transitions 170/318 dead transitions. [2021-03-26 05:54:47,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 318 transitions, 2922 flow [2021-03-26 05:54:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-03-26 05:54:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-03-26 05:54:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 998 transitions. [2021-03-26 05:54:47,778 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6397435897435897 [2021-03-26 05:54:47,778 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 998 transitions. [2021-03-26 05:54:47,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 998 transitions. [2021-03-26 05:54:47,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:47,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 998 transitions. [2021-03-26 05:54:47,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 33.266666666666666) internal successors, (998), 30 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:47,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 52.0) internal successors, (1612), 31 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:47,784 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 52.0) internal successors, (1612), 31 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:47,784 INFO L185 Difference]: Start difference. First operand has 50 places, 46 transitions, 321 flow. Second operand 30 states and 998 transitions. [2021-03-26 05:54:47,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 318 transitions, 2922 flow [2021-03-26 05:54:47,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 318 transitions, 2584 flow, removed 169 selfloop flow, removed 3 redundant places. [2021-03-26 05:54:47,895 INFO L241 Difference]: Finished difference. Result has 102 places, 68 transitions, 770 flow [2021-03-26 05:54:47,895 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=770, PETRI_PLACES=102, PETRI_TRANSITIONS=68} [2021-03-26 05:54:47,895 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2021-03-26 05:54:47,895 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:47,895 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 68 transitions, 770 flow [2021-03-26 05:54:47,896 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 68 transitions, 770 flow [2021-03-26 05:54:47,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 68 transitions, 770 flow [2021-03-26 05:54:47,972 INFO L129 PetriNetUnfolder]: 336/649 cut-off events. [2021-03-26 05:54:47,972 INFO L130 PetriNetUnfolder]: For 15168/15284 co-relation queries the response was YES. [2021-03-26 05:54:47,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 649 events. 336/649 cut-off events. For 15168/15284 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3316 event pairs, 33 based on Foata normal form. 5/605 useless extension candidates. Maximal degree in co-relation 4356. Up to 317 conditions per place. [2021-03-26 05:54:47,990 INFO L142 LiptonReduction]: Number of co-enabled transitions 824 [2021-03-26 05:54:48,076 INFO L154 LiptonReduction]: Checked pairs total: 120 [2021-03-26 05:54:48,077 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 05:54:48,077 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 182 [2021-03-26 05:54:48,080 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 772 flow [2021-03-26 05:54:48,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:54:48,081 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:48,081 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:48,303 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:54:48,304 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:48,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1731414259, now seen corresponding path program 1 times [2021-03-26 05:54:48,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:48,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950250967] [2021-03-26 05:54:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:48,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,352 INFO L142 QuantifierPusher]: treesize reduction 14, result has 56.3 percent of original size [2021-03-26 05:54:48,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:54:48,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:48,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:48,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 05:54:48,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950250967] [2021-03-26 05:54:48,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038532934] [2021-03-26 05:54:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:54:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:48,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2021-03-26 05:54:48,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:54:48,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:48,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:48,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:54:48,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,459 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:48,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:48,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:54:48,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:48,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:48,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:48,493 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 05:54:48,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-03-26 05:54:48,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2021-03-26 05:54:48,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205477738] [2021-03-26 05:54:48,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 05:54:48,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 05:54:48,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-03-26 05:54:48,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 56 [2021-03-26 05:54:48,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 772 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 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 05:54:48,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:48,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 56 [2021-03-26 05:54:48,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:48,632 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][55], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 229#(and v_assert (<= min max) (<= min (select A 0))), Black: 60#(not b1), Black: 231#(and v_assert (<= min max) (= i 0) (<= min (select A 0))), Black: 233#(and v_assert (<= min max) (= i 0) (<= j i)), Black: 235#(and v_assert (<= min max) (< j N) (<= j i)), 4#thread5EXITtrue, Black: 237#(and v_assert (<= min max) (= i 0)), Black: 239#(and v_assert (<= min max)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 123#(<= min max), Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 109#(and v_assert (= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 205#(and (<= min max) (= i 0) (<= j i)), Black: 207#(and (< j N) (<= j i)), Black: 211#(and (<= min max) (= i 0) (= min (select A i))), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), Black: 219#(and (<= min max) (= i 0) (<= min (select A 0))), 316#true, Black: 221#(and (<= min max) (= i 0)), Black: 223#(and v_assert (<= min max) (= i 0) (= min (select A i))), Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:48,632 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2021-03-26 05:54:48,632 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:48,632 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:48,632 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:48,745 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][55], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 229#(and v_assert (<= min max) (<= min (select A 0))), Black: 60#(not b1), Black: 231#(and v_assert (<= min max) (= i 0) (<= min (select A 0))), Black: 233#(and v_assert (<= min max) (= i 0) (<= j i)), Black: 235#(and v_assert (<= min max) (< j N) (<= j i)), 4#thread5EXITtrue, Black: 237#(and v_assert (<= min max) (= i 0)), Black: 239#(and v_assert (<= min max)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 123#(<= min max), Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 109#(and v_assert (= min (select A 0))), Black: 205#(and (<= min max) (= i 0) (<= j i)), Black: 207#(and (< j N) (<= j i)), Black: 211#(and (<= min max) (= i 0) (= min (select A i))), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), 316#true, Black: 219#(and (<= min max) (= i 0) (<= min (select A 0))), Black: 221#(and (<= min max) (= i 0)), Black: 223#(and v_assert (<= min max) (= i 0) (= min (select A i))), Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:48,746 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:48,746 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:48,746 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:48,746 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:48,746 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:48,840 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][55], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), Black: 229#(and v_assert (<= min max) (<= min (select A 0))), Black: 231#(and v_assert (<= min max) (= i 0) (<= min (select A 0))), Black: 233#(and v_assert (<= min max) (= i 0) (<= j i)), 4#thread5EXITtrue, Black: 235#(and v_assert (<= min max) (< j N) (<= j i)), Black: 237#(and v_assert (<= min max) (= i 0)), Black: 239#(and v_assert (<= min max)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 123#(<= min max), Black: 69#(not b2), Black: 191#(and (= i 0) (<= j i)), 76#true, 14#L62-1true, 21#L40-1true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 109#(and v_assert (= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 205#(and (<= min max) (= i 0) (<= j i)), Black: 207#(and (< j N) (<= j i)), Black: 211#(and (<= min max) (= i 0) (= min (select A i))), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), Black: 219#(and (<= min max) (= i 0) (<= min (select A 0))), 316#true, Black: 221#(and (<= min max) (= i 0)), Black: 223#(and v_assert (<= min max) (= i 0) (= min (select A i))), Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:48,840 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 05:54:48,840 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:48,840 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:48,840 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:49,122 INFO L129 PetriNetUnfolder]: 3176/4501 cut-off events. [2021-03-26 05:54:49,123 INFO L130 PetriNetUnfolder]: For 109637/110630 co-relation queries the response was YES. [2021-03-26 05:54:49,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32468 conditions, 4501 events. 3176/4501 cut-off events. For 109637/110630 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 23367 event pairs, 701 based on Foata normal form. 366/4428 useless extension candidates. Maximal degree in co-relation 32277. Up to 1928 conditions per place. [2021-03-26 05:54:49,249 INFO L132 encePairwiseOnDemand]: 52/56 looper letters, 57 selfloop transitions, 22 changer transitions 0/101 dead transitions. [2021-03-26 05:54:49,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 101 transitions, 1364 flow [2021-03-26 05:54:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 05:54:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 05:54:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2021-03-26 05:54:49,251 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7544642857142857 [2021-03-26 05:54:49,251 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 169 transitions. [2021-03-26 05:54:49,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 169 transitions. [2021-03-26 05:54:49,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:49,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 169 transitions. [2021-03-26 05:54:49,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 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 05:54:49,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 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 05:54:49,253 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 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 05:54:49,253 INFO L185 Difference]: Start difference. First operand has 85 places, 67 transitions, 772 flow. Second operand 4 states and 169 transitions. [2021-03-26 05:54:49,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 101 transitions, 1364 flow [2021-03-26 05:54:49,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 101 transitions, 1185 flow, removed 77 selfloop flow, removed 16 redundant places. [2021-03-26 05:54:49,427 INFO L241 Difference]: Finished difference. Result has 74 places, 78 transitions, 845 flow [2021-03-26 05:54:49,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=845, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2021-03-26 05:54:49,428 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2021-03-26 05:54:49,428 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:49,428 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 78 transitions, 845 flow [2021-03-26 05:54:49,428 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 78 transitions, 845 flow [2021-03-26 05:54:49,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 78 transitions, 845 flow [2021-03-26 05:54:49,469 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][27], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 69#(not b2), Black: 191#(and (= i 0) (<= j i)), 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), 316#true, Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:49,469 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2021-03-26 05:54:49,469 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:49,469 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-03-26 05:54:49,469 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-03-26 05:54:49,470 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][27], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 76#true, 14#L62-1true, 21#L40-1true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), 316#true, Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:49,470 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-03-26 05:54:49,470 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:49,470 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:49,470 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:49,484 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][27], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 78#(= max (select A 0)), 14#L62-1true, 21#L40-1true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), 316#true, Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:49,484 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:49,484 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:49,484 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:49,484 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:49,484 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-26 05:54:49,484 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][27], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 76#true, 14#L62-1true, 21#L40-1true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), 316#true, Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:49,484 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 05:54:49,484 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:49,485 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:49,485 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:49,485 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:49,503 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][63], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 326#(<= i k), 72#(and v_assert (not b2)), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 76#true, 14#L62-1true, 22#L38true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), 316#true, Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:49,504 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-26 05:54:49,504 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:49,504 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:49,504 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:49,504 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][27], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 76#true, 14#L62-1true, 21#L40-1true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), 316#true, Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:49,504 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 05:54:49,504 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-26 05:54:49,504 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-26 05:54:49,504 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 05:54:49,504 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:49,504 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:49,509 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][51], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 11#thread2EXITtrue, 76#true, 14#L62-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), 122#(<= min (select A 0)), Black: 217#(and (<= min max) (<= min (select A 0))), 316#true, Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:49,509 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 05:54:49,509 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:49,509 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:49,509 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:49,513 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][27], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 69#(not b2), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 76#true, 14#L62-1true, 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), 316#true, Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:49,513 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 05:54:49,513 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:54:49,513 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:49,513 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 05:54:49,522 INFO L129 PetriNetUnfolder]: 606/1062 cut-off events. [2021-03-26 05:54:49,522 INFO L130 PetriNetUnfolder]: For 12442/12684 co-relation queries the response was YES. [2021-03-26 05:54:49,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6600 conditions, 1062 events. 606/1062 cut-off events. For 12442/12684 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5505 event pairs, 69 based on Foata normal form. 28/1013 useless extension candidates. Maximal degree in co-relation 6402. Up to 558 conditions per place. [2021-03-26 05:54:49,544 INFO L142 LiptonReduction]: Number of co-enabled transitions 870 [2021-03-26 05:54:49,625 INFO L154 LiptonReduction]: Checked pairs total: 37 [2021-03-26 05:54:49,626 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 05:54:49,626 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 198 [2021-03-26 05:54:49,627 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 847 flow [2021-03-26 05:54:49,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 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 05:54:49,627 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:49,627 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:49,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:54:49,850 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:49,851 INFO L82 PathProgramCache]: Analyzing trace with hash -605514939, now seen corresponding path program 1 times [2021-03-26 05:54:49,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:49,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764717553] [2021-03-26 05:54:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:49,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:49,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:49,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:49,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:49,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:49,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:49,890 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 05:54:49,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764717553] [2021-03-26 05:54:49,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 05:54:49,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 05:54:49,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671253690] [2021-03-26 05:54:49,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 05:54:49,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:49,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 05:54:49,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 05:54:49,891 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 57 [2021-03-26 05:54:49,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 847 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 05:54:49,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:49,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 57 [2021-03-26 05:54:49,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:50,541 INFO L129 PetriNetUnfolder]: 3403/4965 cut-off events. [2021-03-26 05:54:50,542 INFO L130 PetriNetUnfolder]: For 63499/64532 co-relation queries the response was YES. [2021-03-26 05:54:50,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30738 conditions, 4965 events. 3403/4965 cut-off events. For 63499/64532 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 27410 event pairs, 258 based on Foata normal form. 435/5235 useless extension candidates. Maximal degree in co-relation 30327. Up to 2021 conditions per place. [2021-03-26 05:54:50,592 INFO L132 encePairwiseOnDemand]: 52/57 looper letters, 130 selfloop transitions, 19 changer transitions 7/177 dead transitions. [2021-03-26 05:54:50,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 177 transitions, 2326 flow [2021-03-26 05:54:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 05:54:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 05:54:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2021-03-26 05:54:50,594 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7578947368421053 [2021-03-26 05:54:50,594 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 216 transitions. [2021-03-26 05:54:50,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 216 transitions. [2021-03-26 05:54:50,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:50,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 216 transitions. [2021-03-26 05:54:50,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 43.2) internal successors, (216), 5 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 05:54:50,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 05:54:50,596 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 05:54:50,596 INFO L185 Difference]: Start difference. First operand has 74 places, 78 transitions, 847 flow. Second operand 5 states and 216 transitions. [2021-03-26 05:54:50,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 177 transitions, 2326 flow [2021-03-26 05:54:50,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 177 transitions, 2255 flow, removed 12 selfloop flow, removed 2 redundant places. [2021-03-26 05:54:50,670 INFO L241 Difference]: Finished difference. Result has 78 places, 93 transitions, 1093 flow [2021-03-26 05:54:50,670 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1093, PETRI_PLACES=78, PETRI_TRANSITIONS=93} [2021-03-26 05:54:50,670 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2021-03-26 05:54:50,670 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:50,670 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 93 transitions, 1093 flow [2021-03-26 05:54:50,671 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 93 transitions, 1093 flow [2021-03-26 05:54:50,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 93 transitions, 1093 flow [2021-03-26 05:54:50,803 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][58], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 11#thread2EXITtrue, 76#true, 14#L62-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 424#true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 426#(= j l), Black: 429#(and (= j l) (<= N l)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), 122#(<= min (select A 0)), Black: 217#(and (<= min max) (<= min (select A 0)))]) [2021-03-26 05:54:50,803 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-26 05:54:50,803 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:50,803 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:50,803 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:50,820 INFO L129 PetriNetUnfolder]: 622/1198 cut-off events. [2021-03-26 05:54:50,820 INFO L130 PetriNetUnfolder]: For 13575/14051 co-relation queries the response was YES. [2021-03-26 05:54:50,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7192 conditions, 1198 events. 622/1198 cut-off events. For 13575/14051 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7198 event pairs, 75 based on Foata normal form. 76/1201 useless extension candidates. Maximal degree in co-relation 6900. Up to 594 conditions per place. [2021-03-26 05:54:50,841 INFO L142 LiptonReduction]: Number of co-enabled transitions 1072 [2021-03-26 05:54:50,860 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:50,860 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:50,860 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 190 [2021-03-26 05:54:50,861 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 93 transitions, 1093 flow [2021-03-26 05:54:50,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 05:54:50,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:50,861 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:50,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 05:54:50,861 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash -327494149, now seen corresponding path program 2 times [2021-03-26 05:54:50,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:50,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244451538] [2021-03-26 05:54:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:50,893 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-26 05:54:50,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:50,899 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-26 05:54:50,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:50,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:50,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:50,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:50,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:50,915 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 05:54:50,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244451538] [2021-03-26 05:54:50,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 05:54:50,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 05:54:50,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137731888] [2021-03-26 05:54:50,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 05:54:50,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:50,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 05:54:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 05:54:50,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 57 [2021-03-26 05:54:50,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 93 transitions, 1093 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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 05:54:50,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:50,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 57 [2021-03-26 05:54:50,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:51,482 INFO L129 PetriNetUnfolder]: 3213/4675 cut-off events. [2021-03-26 05:54:51,482 INFO L130 PetriNetUnfolder]: For 65932/67292 co-relation queries the response was YES. [2021-03-26 05:54:51,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29917 conditions, 4675 events. 3213/4675 cut-off events. For 65932/67292 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 25721 event pairs, 410 based on Foata normal form. 431/4861 useless extension candidates. Maximal degree in co-relation 29542. Up to 1998 conditions per place. [2021-03-26 05:54:51,539 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 121 selfloop transitions, 21 changer transitions 6/169 dead transitions. [2021-03-26 05:54:51,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 169 transitions, 2321 flow [2021-03-26 05:54:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 05:54:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 05:54:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2021-03-26 05:54:51,541 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7403508771929824 [2021-03-26 05:54:51,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 211 transitions. [2021-03-26 05:54:51,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 211 transitions. [2021-03-26 05:54:51,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:51,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 211 transitions. [2021-03-26 05:54:51,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 05:54:51,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 05:54:51,543 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 05:54:51,543 INFO L185 Difference]: Start difference. First operand has 76 places, 93 transitions, 1093 flow. Second operand 5 states and 211 transitions. [2021-03-26 05:54:51,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 169 transitions, 2321 flow [2021-03-26 05:54:51,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 169 transitions, 2277 flow, removed 22 selfloop flow, removed 2 redundant places. [2021-03-26 05:54:51,669 INFO L241 Difference]: Finished difference. Result has 80 places, 111 transitions, 1425 flow [2021-03-26 05:54:51,669 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1425, PETRI_PLACES=80, PETRI_TRANSITIONS=111} [2021-03-26 05:54:51,670 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2021-03-26 05:54:51,670 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:51,670 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 111 transitions, 1425 flow [2021-03-26 05:54:51,670 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 111 transitions, 1425 flow [2021-03-26 05:54:51,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 111 transitions, 1425 flow [2021-03-26 05:54:51,760 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][89], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 326#(<= i k), Black: 69#(not b2), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 76#true, 14#L62-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 424#true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 426#(= j l), Black: 100#(= min max), Black: 429#(and (= j l) (<= N l)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 433#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 435#(and (= k i) (= l i)), 122#(<= min (select A 0)), Black: 439#(and (= k i) (= l i) (<= N i)), Black: 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:51,760 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-26 05:54:51,760 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-26 05:54:51,761 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:51,761 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-26 05:54:51,828 INFO L129 PetriNetUnfolder]: 1070/1863 cut-off events. [2021-03-26 05:54:51,828 INFO L130 PetriNetUnfolder]: For 27879/28663 co-relation queries the response was YES. [2021-03-26 05:54:51,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12688 conditions, 1863 events. 1070/1863 cut-off events. For 27879/28663 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 11212 event pairs, 195 based on Foata normal form. 86/1725 useless extension candidates. Maximal degree in co-relation 12399. Up to 977 conditions per place. [2021-03-26 05:54:51,865 INFO L142 LiptonReduction]: Number of co-enabled transitions 1152 [2021-03-26 05:54:51,885 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:51,886 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:51,886 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 216 [2021-03-26 05:54:51,886 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 111 transitions, 1425 flow [2021-03-26 05:54:51,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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 05:54:51,887 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:51,887 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:51,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 05:54:51,887 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:51,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash -406243333, now seen corresponding path program 3 times [2021-03-26 05:54:51,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:51,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344748463] [2021-03-26 05:54:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:51,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:51,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:51,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:51,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:51,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:51,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:51,915 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 05:54:51,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344748463] [2021-03-26 05:54:51,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 05:54:51,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 05:54:51,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453635266] [2021-03-26 05:54:51,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 05:54:51,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 05:54:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 05:54:51,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 57 [2021-03-26 05:54:51,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 111 transitions, 1425 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 05:54:51,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:51,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 57 [2021-03-26 05:54:51,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:52,352 INFO L129 PetriNetUnfolder]: 2686/3852 cut-off events. [2021-03-26 05:54:52,353 INFO L130 PetriNetUnfolder]: For 53671/55093 co-relation queries the response was YES. [2021-03-26 05:54:52,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26130 conditions, 3852 events. 2686/3852 cut-off events. For 53671/55093 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 19808 event pairs, 651 based on Foata normal form. 363/3900 useless extension candidates. Maximal degree in co-relation 25851. Up to 2007 conditions per place. [2021-03-26 05:54:52,389 INFO L132 encePairwiseOnDemand]: 53/57 looper letters, 79 selfloop transitions, 41 changer transitions 0/141 dead transitions. [2021-03-26 05:54:52,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 141 transitions, 2038 flow [2021-03-26 05:54:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 05:54:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 05:54:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2021-03-26 05:54:52,390 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7587719298245614 [2021-03-26 05:54:52,390 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 173 transitions. [2021-03-26 05:54:52,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 173 transitions. [2021-03-26 05:54:52,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:52,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 173 transitions. [2021-03-26 05:54:52,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 43.25) internal successors, (173), 4 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 05:54:52,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 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 05:54:52,392 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 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 05:54:52,392 INFO L185 Difference]: Start difference. First operand has 80 places, 111 transitions, 1425 flow. Second operand 4 states and 173 transitions. [2021-03-26 05:54:52,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 141 transitions, 2038 flow [2021-03-26 05:54:52,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 141 transitions, 2010 flow, removed 14 selfloop flow, removed 0 redundant places. [2021-03-26 05:54:52,444 INFO L241 Difference]: Finished difference. Result has 85 places, 121 transitions, 1683 flow [2021-03-26 05:54:52,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1683, PETRI_PLACES=85, PETRI_TRANSITIONS=121} [2021-03-26 05:54:52,444 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 48 predicate places. [2021-03-26 05:54:52,444 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:52,444 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 121 transitions, 1683 flow [2021-03-26 05:54:52,444 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 121 transitions, 1683 flow [2021-03-26 05:54:52,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 121 transitions, 1683 flow [2021-03-26 05:54:52,570 INFO L129 PetriNetUnfolder]: 868/1461 cut-off events. [2021-03-26 05:54:52,570 INFO L130 PetriNetUnfolder]: For 24393/24981 co-relation queries the response was YES. [2021-03-26 05:54:52,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10870 conditions, 1461 events. 868/1461 cut-off events. For 24393/24981 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 8057 event pairs, 138 based on Foata normal form. 72/1376 useless extension candidates. Maximal degree in co-relation 10688. Up to 802 conditions per place. [2021-03-26 05:54:52,598 INFO L142 LiptonReduction]: Number of co-enabled transitions 1136 [2021-03-26 05:54:52,676 INFO L154 LiptonReduction]: Checked pairs total: 11 [2021-03-26 05:54:52,677 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 05:54:52,677 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 233 [2021-03-26 05:54:52,678 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 121 transitions, 1688 flow [2021-03-26 05:54:52,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 05:54:52,678 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:52,678 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:52,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 05:54:52,679 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:52,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:52,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1161489348, now seen corresponding path program 1 times [2021-03-26 05:54:52,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:52,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524926932] [2021-03-26 05:54:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:52,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:52,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:52,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:52,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:52,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:52,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:52,717 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 05:54:52,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524926932] [2021-03-26 05:54:52,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 05:54:52,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 05:54:52,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851604975] [2021-03-26 05:54:52,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 05:54:52,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 05:54:52,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 05:54:52,719 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 58 [2021-03-26 05:54:52,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 121 transitions, 1688 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 05:54:52,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:52,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 58 [2021-03-26 05:54:52,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:53,082 INFO L129 PetriNetUnfolder]: 2297/3199 cut-off events. [2021-03-26 05:54:53,082 INFO L130 PetriNetUnfolder]: For 55074/56405 co-relation queries the response was YES. [2021-03-26 05:54:53,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23564 conditions, 3199 events. 2297/3199 cut-off events. For 55074/56405 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 15743 event pairs, 340 based on Foata normal form. 392/3286 useless extension candidates. Maximal degree in co-relation 23411. Up to 1675 conditions per place. [2021-03-26 05:54:53,115 INFO L132 encePairwiseOnDemand]: 52/58 looper letters, 106 selfloop transitions, 33 changer transitions 26/186 dead transitions. [2021-03-26 05:54:53,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 186 transitions, 2912 flow [2021-03-26 05:54:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 05:54:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 05:54:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2021-03-26 05:54:53,116 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7517241379310344 [2021-03-26 05:54:53,116 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 218 transitions. [2021-03-26 05:54:53,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 218 transitions. [2021-03-26 05:54:53,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:53,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 218 transitions. [2021-03-26 05:54:53,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 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 05:54:53,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 05:54:53,118 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 05:54:53,118 INFO L185 Difference]: Start difference. First operand has 85 places, 121 transitions, 1688 flow. Second operand 5 states and 218 transitions. [2021-03-26 05:54:53,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 186 transitions, 2912 flow [2021-03-26 05:54:53,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 186 transitions, 2865 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-26 05:54:53,170 INFO L241 Difference]: Finished difference. Result has 89 places, 119 transitions, 1735 flow [2021-03-26 05:54:53,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1735, PETRI_PLACES=89, PETRI_TRANSITIONS=119} [2021-03-26 05:54:53,171 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 52 predicate places. [2021-03-26 05:54:53,171 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:53,171 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 119 transitions, 1735 flow [2021-03-26 05:54:53,172 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 119 transitions, 1735 flow [2021-03-26 05:54:53,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 119 transitions, 1735 flow [2021-03-26 05:54:53,245 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][96], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 69#(not b2), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 76#true, 14#L62-1true, 463#(<= N j), Black: 462#(= j i), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 424#true, 44#L27-1true, Black: 426#(= j l), Black: 99#(= min (select A 0)), Black: 429#(and (= j l) (<= N l)), Black: 100#(= min max), 433#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 435#(and (= k i) (= l i)), 122#(<= min (select A 0)), Black: 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 439#(and (= k i) (= l i) (<= N i))]) [2021-03-26 05:54:53,245 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is not cut-off event [2021-03-26 05:54:53,245 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-26 05:54:53,245 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-26 05:54:53,245 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-26 05:54:53,264 INFO L129 PetriNetUnfolder]: 655/1060 cut-off events. [2021-03-26 05:54:53,264 INFO L130 PetriNetUnfolder]: For 19144/19528 co-relation queries the response was YES. [2021-03-26 05:54:53,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8353 conditions, 1060 events. 655/1060 cut-off events. For 19144/19528 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5257 event pairs, 91 based on Foata normal form. 47/1013 useless extension candidates. Maximal degree in co-relation 8236. Up to 605 conditions per place. [2021-03-26 05:54:53,288 INFO L142 LiptonReduction]: Number of co-enabled transitions 1020 [2021-03-26 05:54:53,295 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:53,295 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:53,295 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-03-26 05:54:53,296 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 119 transitions, 1735 flow [2021-03-26 05:54:53,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 05:54:53,298 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:53,298 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:53,298 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 05:54:53,298 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:53,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:53,299 INFO L82 PathProgramCache]: Analyzing trace with hash 487949566, now seen corresponding path program 2 times [2021-03-26 05:54:53,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:53,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922909021] [2021-03-26 05:54:53,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:53,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:53,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:53,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,330 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 05:54:53,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922909021] [2021-03-26 05:54:53,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 05:54:53,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 05:54:53,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303453727] [2021-03-26 05:54:53,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 05:54:53,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:53,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 05:54:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 05:54:53,331 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 58 [2021-03-26 05:54:53,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 119 transitions, 1735 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 05:54:53,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:53,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 58 [2021-03-26 05:54:53,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:53,576 INFO L129 PetriNetUnfolder]: 1940/2721 cut-off events. [2021-03-26 05:54:53,576 INFO L130 PetriNetUnfolder]: For 46611/47631 co-relation queries the response was YES. [2021-03-26 05:54:53,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20675 conditions, 2721 events. 1940/2721 cut-off events. For 46611/47631 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 12611 event pairs, 435 based on Foata normal form. 188/2699 useless extension candidates. Maximal degree in co-relation 20502. Up to 1781 conditions per place. [2021-03-26 05:54:53,603 INFO L132 encePairwiseOnDemand]: 54/58 looper letters, 85 selfloop transitions, 26 changer transitions 2/134 dead transitions. [2021-03-26 05:54:53,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 134 transitions, 2144 flow [2021-03-26 05:54:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 05:54:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 05:54:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2021-03-26 05:54:53,604 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7456896551724138 [2021-03-26 05:54:53,604 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 173 transitions. [2021-03-26 05:54:53,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 173 transitions. [2021-03-26 05:54:53,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:53,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 173 transitions. [2021-03-26 05:54:53,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 43.25) internal successors, (173), 4 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 05:54:53,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 05:54:53,606 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 05:54:53,606 INFO L185 Difference]: Start difference. First operand has 88 places, 119 transitions, 1735 flow. Second operand 4 states and 173 transitions. [2021-03-26 05:54:53,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 134 transitions, 2144 flow [2021-03-26 05:54:53,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 134 transitions, 2096 flow, removed 8 selfloop flow, removed 1 redundant places. [2021-03-26 05:54:53,646 INFO L241 Difference]: Finished difference. Result has 91 places, 117 transitions, 1745 flow [2021-03-26 05:54:53,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1745, PETRI_PLACES=91, PETRI_TRANSITIONS=117} [2021-03-26 05:54:53,646 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 54 predicate places. [2021-03-26 05:54:53,646 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:53,646 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 117 transitions, 1745 flow [2021-03-26 05:54:53,647 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 117 transitions, 1745 flow [2021-03-26 05:54:53,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 117 transitions, 1745 flow [2021-03-26 05:54:53,741 INFO L129 PetriNetUnfolder]: 665/1077 cut-off events. [2021-03-26 05:54:53,741 INFO L130 PetriNetUnfolder]: For 20042/20407 co-relation queries the response was YES. [2021-03-26 05:54:53,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8673 conditions, 1077 events. 665/1077 cut-off events. For 20042/20407 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5298 event pairs, 103 based on Foata normal form. 43/1023 useless extension candidates. Maximal degree in co-relation 8554. Up to 626 conditions per place. [2021-03-26 05:54:53,761 INFO L142 LiptonReduction]: Number of co-enabled transitions 990 [2021-03-26 05:54:53,768 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:53,768 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:53,768 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 122 [2021-03-26 05:54:53,770 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 117 transitions, 1745 flow [2021-03-26 05:54:53,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 05:54:53,770 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:53,770 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:53,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 05:54:53,770 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:53,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1171482522, now seen corresponding path program 1 times [2021-03-26 05:54:53,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:53,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193891275] [2021-03-26 05:54:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:53,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:53,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:53,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:54:53,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193891275] [2021-03-26 05:54:53,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378023048] [2021-03-26 05:54:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:54:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:53,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2021-03-26 05:54:53,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:54:53,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,876 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:53,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:53,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:54:53,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:53,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:53,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:54:53,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:53,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:53,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:53,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:53,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:53,889 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-26 05:54:53,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:53,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:54:53,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:54:53,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-03-26 05:54:53,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603123009] [2021-03-26 05:54:53,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 05:54:53,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 05:54:53,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 05:54:53,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 58 [2021-03-26 05:54:53,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 117 transitions, 1745 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 05:54:53,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:53,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 58 [2021-03-26 05:54:53,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:54,267 INFO L129 PetriNetUnfolder]: 2481/3526 cut-off events. [2021-03-26 05:54:54,267 INFO L130 PetriNetUnfolder]: For 60010/61090 co-relation queries the response was YES. [2021-03-26 05:54:54,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27218 conditions, 3526 events. 2481/3526 cut-off events. For 60010/61090 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 17538 event pairs, 531 based on Foata normal form. 265/3503 useless extension candidates. Maximal degree in co-relation 26987. Up to 2133 conditions per place. [2021-03-26 05:54:54,309 INFO L132 encePairwiseOnDemand]: 54/58 looper letters, 111 selfloop transitions, 22 changer transitions 1/155 dead transitions. [2021-03-26 05:54:54,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 155 transitions, 2577 flow [2021-03-26 05:54:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 05:54:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 05:54:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2021-03-26 05:54:54,310 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.75 [2021-03-26 05:54:54,310 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 174 transitions. [2021-03-26 05:54:54,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 174 transitions. [2021-03-26 05:54:54,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:54,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 174 transitions. [2021-03-26 05:54:54,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 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 05:54:54,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 05:54:54,312 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 05:54:54,312 INFO L185 Difference]: Start difference. First operand has 91 places, 117 transitions, 1745 flow. Second operand 4 states and 174 transitions. [2021-03-26 05:54:54,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 155 transitions, 2577 flow [2021-03-26 05:54:54,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 2529 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 05:54:54,383 INFO L241 Difference]: Finished difference. Result has 93 places, 119 transitions, 1785 flow [2021-03-26 05:54:54,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1785, PETRI_PLACES=93, PETRI_TRANSITIONS=119} [2021-03-26 05:54:54,383 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 56 predicate places. [2021-03-26 05:54:54,383 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:54,383 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 119 transitions, 1785 flow [2021-03-26 05:54:54,384 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 119 transitions, 1785 flow [2021-03-26 05:54:54,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 119 transitions, 1785 flow [2021-03-26 05:54:54,537 INFO L129 PetriNetUnfolder]: 879/1389 cut-off events. [2021-03-26 05:54:54,538 INFO L130 PetriNetUnfolder]: For 28366/28892 co-relation queries the response was YES. [2021-03-26 05:54:54,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11859 conditions, 1389 events. 879/1389 cut-off events. For 28366/28892 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6923 event pairs, 130 based on Foata normal form. 53/1318 useless extension candidates. Maximal degree in co-relation 11739. Up to 822 conditions per place. [2021-03-26 05:54:54,563 INFO L142 LiptonReduction]: Number of co-enabled transitions 1024 [2021-03-26 05:54:54,569 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:54,569 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:54,570 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 187 [2021-03-26 05:54:54,570 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 119 transitions, 1785 flow [2021-03-26 05:54:54,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 05:54:54,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:54,571 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:54,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-03-26 05:54:54,793 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1501289334, now seen corresponding path program 2 times [2021-03-26 05:54:54,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:54,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994059871] [2021-03-26 05:54:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:54,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:54,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:54:54,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994059871] [2021-03-26 05:54:54,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098717859] [2021-03-26 05:54:54,817 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 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 05:54:54,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-26 05:54:54,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 05:54:54,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2021-03-26 05:54:54,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:54:54,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:54,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,876 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:54,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:54,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:54:54,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:54,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:54,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:54:54,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:54,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:54,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:54:54,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:54,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:54,925 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-26 05:54:54,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:54,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:54:54,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:54:54,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-03-26 05:54:54,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286111634] [2021-03-26 05:54:54,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 05:54:54,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 05:54:54,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 05:54:54,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 58 [2021-03-26 05:54:54,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 119 transitions, 1785 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 05:54:54,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:54,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 58 [2021-03-26 05:54:54,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:55,289 INFO L129 PetriNetUnfolder]: 2163/3037 cut-off events. [2021-03-26 05:54:55,290 INFO L130 PetriNetUnfolder]: For 52439/53403 co-relation queries the response was YES. [2021-03-26 05:54:55,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24086 conditions, 3037 events. 2163/3037 cut-off events. For 52439/53403 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 14344 event pairs, 499 based on Foata normal form. 182/2976 useless extension candidates. Maximal degree in co-relation 23891. Up to 2132 conditions per place. [2021-03-26 05:54:55,315 INFO L132 encePairwiseOnDemand]: 54/58 looper letters, 109 selfloop transitions, 24 changer transitions 0/154 dead transitions. [2021-03-26 05:54:55,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 154 transitions, 2568 flow [2021-03-26 05:54:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 05:54:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 05:54:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2021-03-26 05:54:55,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.75 [2021-03-26 05:54:55,317 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 174 transitions. [2021-03-26 05:54:55,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 174 transitions. [2021-03-26 05:54:55,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:55,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 174 transitions. [2021-03-26 05:54:55,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 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 05:54:55,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 05:54:55,318 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 05:54:55,318 INFO L185 Difference]: Start difference. First operand has 93 places, 119 transitions, 1785 flow. Second operand 4 states and 174 transitions. [2021-03-26 05:54:55,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 154 transitions, 2568 flow [2021-03-26 05:54:55,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 154 transitions, 2525 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-26 05:54:55,374 INFO L241 Difference]: Finished difference. Result has 96 places, 124 transitions, 1897 flow [2021-03-26 05:54:55,374 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1748, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1897, PETRI_PLACES=96, PETRI_TRANSITIONS=124} [2021-03-26 05:54:55,374 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2021-03-26 05:54:55,374 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:55,374 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 124 transitions, 1897 flow [2021-03-26 05:54:55,374 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 124 transitions, 1897 flow [2021-03-26 05:54:55,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 124 transitions, 1897 flow [2021-03-26 05:54:55,521 INFO L129 PetriNetUnfolder]: 713/1134 cut-off events. [2021-03-26 05:54:55,521 INFO L130 PetriNetUnfolder]: For 21594/21974 co-relation queries the response was YES. [2021-03-26 05:54:55,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9484 conditions, 1134 events. 713/1134 cut-off events. For 21594/21974 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5535 event pairs, 108 based on Foata normal form. 42/1096 useless extension candidates. Maximal degree in co-relation 9366. Up to 664 conditions per place. [2021-03-26 05:54:55,547 INFO L142 LiptonReduction]: Number of co-enabled transitions 1074 [2021-03-26 05:54:55,555 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:54:55,555 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:54:55,555 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 181 [2021-03-26 05:54:55,557 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 124 transitions, 1897 flow [2021-03-26 05:54:55,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 05:54:55,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:55,557 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:55,767 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:54:55,768 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1695782522, now seen corresponding path program 1 times [2021-03-26 05:54:55,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:55,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254333089] [2021-03-26 05:54:55,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:55,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:55,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:55,818 INFO L142 QuantifierPusher]: treesize reduction 14, result has 54.8 percent of original size [2021-03-26 05:54:55,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 05:54:55,828 INFO L142 QuantifierPusher]: treesize reduction 8, result has 27.3 percent of original size [2021-03-26 05:54:55,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:55,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:54:55,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254333089] [2021-03-26 05:54:55,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440504288] [2021-03-26 05:54:55,837 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:54:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:55,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2021-03-26 05:54:55,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:54:55,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:55,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:55,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:55,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:54:55,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:55,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:55,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:54:55,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:55,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:55,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:54:55,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 7 [2021-03-26 05:54:55,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:55,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:55,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:54:55,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:55,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:54:55,956 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2021-03-26 05:54:55,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:55,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:55,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:54:55,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:54:55,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:54:55,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:54:55,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:55,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:55,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:55,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:55,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:55,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:55,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:55,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-03-26 05:54:55,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:55,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:55,988 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:54:55,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:55,990 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:54:55,990 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-03-26 05:54:55,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:55,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:55,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,005 INFO L142 QuantifierPusher]: treesize reduction 23, result has 17.9 percent of original size [2021-03-26 05:54:56,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:56,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:56,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:56,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-03-26 05:54:56,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:56,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:54:56,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:54:56,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-03-26 05:54:56,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770607330] [2021-03-26 05:54:56,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 05:54:56,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:56,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 05:54:56,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-26 05:54:56,032 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 58 [2021-03-26 05:54:56,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 124 transitions, 1897 flow. Second operand has 10 states, 10 states have (on average 31.6) internal successors, (316), 10 states have internal predecessors, (316), 0 states have call successors, (0), 0 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 05:54:56,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:56,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 58 [2021-03-26 05:54:56,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:56,894 INFO L129 PetriNetUnfolder]: 3418/5029 cut-off events. [2021-03-26 05:54:56,894 INFO L130 PetriNetUnfolder]: For 87545/88903 co-relation queries the response was YES. [2021-03-26 05:54:56,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41350 conditions, 5029 events. 3418/5029 cut-off events. For 87545/88903 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 28676 event pairs, 490 based on Foata normal form. 98/4873 useless extension candidates. Maximal degree in co-relation 41051. Up to 2427 conditions per place. [2021-03-26 05:54:56,941 INFO L132 encePairwiseOnDemand]: 45/58 looper letters, 182 selfloop transitions, 146 changer transitions 27/369 dead transitions. [2021-03-26 05:54:56,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 369 transitions, 6362 flow [2021-03-26 05:54:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-03-26 05:54:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-03-26 05:54:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 902 transitions. [2021-03-26 05:54:56,944 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6220689655172413 [2021-03-26 05:54:56,945 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 902 transitions. [2021-03-26 05:54:56,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 902 transitions. [2021-03-26 05:54:56,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:56,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 902 transitions. [2021-03-26 05:54:56,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 36.08) internal successors, (902), 25 states have internal predecessors, (902), 0 states have call successors, (0), 0 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 05:54:56,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 58.0) internal successors, (1508), 26 states have internal predecessors, (1508), 0 states have call successors, (0), 0 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 05:54:56,950 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 58.0) internal successors, (1508), 26 states have internal predecessors, (1508), 0 states have call successors, (0), 0 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 05:54:56,950 INFO L185 Difference]: Start difference. First operand has 96 places, 124 transitions, 1897 flow. Second operand 25 states and 902 transitions. [2021-03-26 05:54:56,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 369 transitions, 6362 flow [2021-03-26 05:54:57,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 369 transitions, 6280 flow, removed 22 selfloop flow, removed 1 redundant places. [2021-03-26 05:54:57,056 INFO L241 Difference]: Finished difference. Result has 131 places, 214 transitions, 3818 flow [2021-03-26 05:54:57,056 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1868, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3818, PETRI_PLACES=131, PETRI_TRANSITIONS=214} [2021-03-26 05:54:57,056 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 94 predicate places. [2021-03-26 05:54:57,057 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:54:57,057 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 214 transitions, 3818 flow [2021-03-26 05:54:57,057 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 214 transitions, 3818 flow [2021-03-26 05:54:57,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 214 transitions, 3818 flow [2021-03-26 05:54:57,251 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][165], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 14#L62-1true, 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), Black: 429#(and (= j l) (<= N l)), 433#true, Black: 435#(and (= k i) (= l i)), Black: 439#(and (= k i) (= l i) (<= N i)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), 726#(and v_assert (<= min max)), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, Black: 722#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 630#(= min max), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 664#(<= min max), Black: 712#(and (= min max) (= i 0) (<= (select A 0) max)), Black: 714#(and v_assert (= min max)), Black: 730#(and v_assert (<= min max) (= i 0) (<= (select A 0) max)), Black: 716#(and (= i 0) (= max (select A 0))), Black: 732#(and (<= min max) (= i 0)), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 551#(= l k), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:57,251 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 05:54:57,251 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:54:57,251 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:54:57,251 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:54:57,253 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][165], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 13#thread1EXITtrue, 14#L62-1true, 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), Black: 429#(and (= j l) (<= N l)), 433#true, Black: 435#(and (= k i) (= l i)), Black: 439#(and (= k i) (= l i) (<= N i)), Black: 445#(= l i), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), 726#(and v_assert (<= min max)), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, Black: 722#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 630#(= min max), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 664#(<= min max), Black: 712#(and (= min max) (= i 0) (<= (select A 0) max)), Black: 714#(and v_assert (= min max)), Black: 730#(and v_assert (<= min max) (= i 0) (<= (select A 0) max)), Black: 716#(and (= i 0) (= max (select A 0))), Black: 732#(and (<= min max) (= i 0)), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 551#(= l k), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:57,253 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 05:54:57,254 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:54:57,254 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:54:57,254 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:54:57,258 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][165], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 13#thread1EXITtrue, 14#L62-1true, 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), Black: 429#(and (= j l) (<= N l)), 433#true, Black: 435#(and (= k i) (= l i)), Black: 439#(and (= k i) (= l i) (<= N i)), Black: 445#(= l i), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), 726#(and v_assert (<= min max)), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, Black: 722#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 630#(= min max), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 664#(<= min max), Black: 712#(and (= min max) (= i 0) (<= (select A 0) max)), Black: 714#(and v_assert (= min max)), Black: 730#(and v_assert (<= min max) (= i 0) (<= (select A 0) max)), Black: 716#(and (= i 0) (= max (select A 0))), Black: 732#(and (<= min max) (= i 0)), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 551#(= l k), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0)))]) [2021-03-26 05:54:57,258 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:54:57,258 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:54:57,259 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:54:57,259 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:54:57,259 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:54:57,265 INFO L129 PetriNetUnfolder]: 1244/2054 cut-off events. [2021-03-26 05:54:57,265 INFO L130 PetriNetUnfolder]: For 50026/50728 co-relation queries the response was YES. [2021-03-26 05:54:57,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18965 conditions, 2054 events. 1244/2054 cut-off events. For 50026/50728 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 11988 event pairs, 207 based on Foata normal form. 28/1891 useless extension candidates. Maximal degree in co-relation 18745. Up to 1192 conditions per place. [2021-03-26 05:54:57,305 INFO L142 LiptonReduction]: Number of co-enabled transitions 1656 [2021-03-26 05:54:57,462 INFO L154 LiptonReduction]: Checked pairs total: 95 [2021-03-26 05:54:57,462 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 05:54:57,463 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 406 [2021-03-26 05:54:57,464 INFO L480 AbstractCegarLoop]: Abstraction has has 127 places, 214 transitions, 3844 flow [2021-03-26 05:54:57,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 31.6) internal successors, (316), 10 states have internal predecessors, (316), 0 states have call successors, (0), 0 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 05:54:57,465 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:54:57,465 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:54:57,679 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-03-26 05:54:57,680 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:54:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:54:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash -416831831, now seen corresponding path program 1 times [2021-03-26 05:54:57,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:54:57,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234344354] [2021-03-26 05:54:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:54:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:57,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:54:57,739 INFO L142 QuantifierPusher]: treesize reduction 24, result has 76.0 percent of original size [2021-03-26 05:54:57,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2021-03-26 05:54:57,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 05:54:57,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:57,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 05:54:57,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234344354] [2021-03-26 05:54:57,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409073484] [2021-03-26 05:54:57,824 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 05:54:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:54:57,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2021-03-26 05:54:57,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:54:57,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:57,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:57,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:57,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:57,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:57,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:57,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:57,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:54:57,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:54:57,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:54:57,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:54:57,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:54:57,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:54:57,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 05:54:57,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:54:57,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 05:54:57,910 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.2 percent of original size [2021-03-26 05:54:57,913 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-03-26 05:54:57,919 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,921 INFO L142 QuantifierPusher]: treesize reduction 5, result has 84.8 percent of original size [2021-03-26 05:54:57,923 INFO L147 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size 5 [2021-03-26 05:54:57,925 INFO L147 QuantifierPusher]: treesize reduction 6, result has 66.7 percent of original size 12 [2021-03-26 05:54:57,927 INFO L142 QuantifierPusher]: treesize reduction 6, result has 66.7 percent of original size [2021-03-26 05:54:57,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:54:57,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 05:54:57,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:54:57,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 05:54:57,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,950 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:54:57,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 05:54:57,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-03-26 05:54:57,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:57,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:54:57,958 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:54:57,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:54:57,963 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2021-03-26 05:54:57,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:54:57,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 05:54:57,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:54:57,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 05:54:57,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:54:57,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 05:54:57,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2021-03-26 05:54:57,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,986 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:54:57,988 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,988 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:54:57,988 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2021-03-26 05:54:57,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:57,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:57,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,995 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:57,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:57,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:54:57,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:54:58,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-03-26 05:54:58,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,005 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:54:58,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,007 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:54:58,007 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-03-26 05:54:58,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,013 INFO L142 QuantifierPusher]: treesize reduction 23, result has 17.9 percent of original size [2021-03-26 05:54:58,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:54:58,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,014 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:54:58,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:54:58,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-03-26 05:54:58,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:54:58,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:54:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 05:54:58,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:54:58,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-03-26 05:54:58,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852480478] [2021-03-26 05:54:58,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 05:54:58,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:54:58,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 05:54:58,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-26 05:54:58,034 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2021-03-26 05:54:58,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 214 transitions, 3844 flow. Second operand has 10 states, 10 states have (on average 28.4) internal successors, (284), 10 states have internal predecessors, (284), 0 states have call successors, (0), 0 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 05:54:58,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:54:58,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2021-03-26 05:54:58,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:54:59,379 INFO L129 PetriNetUnfolder]: 7035/9883 cut-off events. [2021-03-26 05:54:59,379 INFO L130 PetriNetUnfolder]: For 229350/231474 co-relation queries the response was YES. [2021-03-26 05:54:59,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88608 conditions, 9883 events. 7035/9883 cut-off events. For 229350/231474 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 55470 event pairs, 959 based on Foata normal form. 101/9813 useless extension candidates. Maximal degree in co-relation 88003. Up to 4551 conditions per place. [2021-03-26 05:54:59,456 INFO L132 encePairwiseOnDemand]: 48/62 looper letters, 95 selfloop transitions, 33 changer transitions 253/393 dead transitions. [2021-03-26 05:54:59,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 393 transitions, 7756 flow [2021-03-26 05:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 05:54:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 05:54:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 386 transitions. [2021-03-26 05:54:59,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5659824046920822 [2021-03-26 05:54:59,458 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 386 transitions. [2021-03-26 05:54:59,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 386 transitions. [2021-03-26 05:54:59,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:54:59,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 386 transitions. [2021-03-26 05:54:59,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 35.09090909090909) internal successors, (386), 11 states have internal predecessors, (386), 0 states have call successors, (0), 0 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 05:54:59,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 62.0) internal successors, (744), 12 states have internal predecessors, (744), 0 states have call successors, (0), 0 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 05:54:59,461 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 62.0) internal successors, (744), 12 states have internal predecessors, (744), 0 states have call successors, (0), 0 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 05:54:59,461 INFO L185 Difference]: Start difference. First operand has 127 places, 214 transitions, 3844 flow. Second operand 11 states and 386 transitions. [2021-03-26 05:54:59,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 393 transitions, 7756 flow [2021-03-26 05:55:00,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 393 transitions, 6976 flow, removed 307 selfloop flow, removed 6 redundant places. [2021-03-26 05:55:00,042 INFO L241 Difference]: Finished difference. Result has 136 places, 118 transitions, 1955 flow [2021-03-26 05:55:00,042 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3356, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1955, PETRI_PLACES=136, PETRI_TRANSITIONS=118} [2021-03-26 05:55:00,042 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 99 predicate places. [2021-03-26 05:55:00,042 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:55:00,042 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 118 transitions, 1955 flow [2021-03-26 05:55:00,043 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 118 transitions, 1955 flow [2021-03-26 05:55:00,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 117 places, 118 transitions, 1955 flow [2021-03-26 05:55:00,152 INFO L129 PetriNetUnfolder]: 713/1236 cut-off events. [2021-03-26 05:55:00,153 INFO L130 PetriNetUnfolder]: For 34982/35707 co-relation queries the response was YES. [2021-03-26 05:55:00,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11497 conditions, 1236 events. 713/1236 cut-off events. For 34982/35707 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6671 event pairs, 105 based on Foata normal form. 36/1166 useless extension candidates. Maximal degree in co-relation 11422. Up to 658 conditions per place. [2021-03-26 05:55:00,173 INFO L142 LiptonReduction]: Number of co-enabled transitions 848 [2021-03-26 05:55:00,201 INFO L154 LiptonReduction]: Checked pairs total: 33 [2021-03-26 05:55:00,202 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 05:55:00,202 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 160 [2021-03-26 05:55:00,202 INFO L480 AbstractCegarLoop]: Abstraction has has 117 places, 118 transitions, 1957 flow [2021-03-26 05:55:00,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 28.4) internal successors, (284), 10 states have internal predecessors, (284), 0 states have call successors, (0), 0 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 05:55:00,202 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:55:00,203 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:55:00,415 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:55:00,416 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:55:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:55:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash -979141353, now seen corresponding path program 1 times [2021-03-26 05:55:00,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:55:00,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030947503] [2021-03-26 05:55:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:55:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:00,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:00,459 INFO L142 QuantifierPusher]: treesize reduction 24, result has 71.1 percent of original size [2021-03-26 05:55:00,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-26 05:55:00,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 05:55:00,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 05:55:00,517 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 05:55:00,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 05:55:00,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 05:55:00,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030947503] [2021-03-26 05:55:00,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877296227] [2021-03-26 05:55:00,549 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 05:55:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:00,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2021-03-26 05:55:00,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:55:00,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:00,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:00,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:00,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:00,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:00,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 05:55:00,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 05:55:00,614 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.4 percent of original size [2021-03-26 05:55:00,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 05:55:00,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 05:55:00,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:55:00,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:55:00,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:55:00,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:55:00,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:00,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:00,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 05:55:00,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:00,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:00,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 05:55:00,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:00,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:00,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 05:55:00,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-03-26 05:55:00,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:00,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:00,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:00,643 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,644 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:00,644 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2021-03-26 05:55:00,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:00,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:00,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 05:55:00,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:00,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:00,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 05:55:00,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,659 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:00,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:00,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 05:55:00,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2021-03-26 05:55:00,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:00,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:00,666 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:00,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:00,674 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:00,674 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:9 [2021-03-26 05:55:00,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:00,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:00,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:00,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:00,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:00,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:00,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:00,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:00,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:00,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:00,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:00,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:00,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:00,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:00,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-03-26 05:55:00,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,716 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:00,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:00,718 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-03-26 05:55:00,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,723 INFO L142 QuantifierPusher]: treesize reduction 23, result has 17.9 percent of original size [2021-03-26 05:55:00,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:00,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:00,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:00,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-03-26 05:55:00,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:00,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 05:55:00,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:55:00,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-03-26 05:55:00,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538139644] [2021-03-26 05:55:00,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 05:55:00,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:55:00,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 05:55:00,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-03-26 05:55:00,741 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2021-03-26 05:55:00,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 118 transitions, 1957 flow. Second operand has 12 states, 12 states have (on average 25.416666666666668) internal successors, (305), 12 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 05:55:00,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:55:00,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2021-03-26 05:55:00,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:55:01,408 INFO L129 PetriNetUnfolder]: 3487/4862 cut-off events. [2021-03-26 05:55:01,408 INFO L130 PetriNetUnfolder]: For 108215/108625 co-relation queries the response was YES. [2021-03-26 05:55:01,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43023 conditions, 4862 events. 3487/4862 cut-off events. For 108215/108625 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 23220 event pairs, 753 based on Foata normal form. 31/4891 useless extension candidates. Maximal degree in co-relation 42932. Up to 3083 conditions per place. [2021-03-26 05:55:01,449 INFO L132 encePairwiseOnDemand]: 53/63 looper letters, 121 selfloop transitions, 25 changer transitions 86/243 dead transitions. [2021-03-26 05:55:01,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 243 transitions, 4491 flow [2021-03-26 05:55:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-26 05:55:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-26 05:55:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 409 transitions. [2021-03-26 05:55:01,450 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4993894993894994 [2021-03-26 05:55:01,450 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 409 transitions. [2021-03-26 05:55:01,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 409 transitions. [2021-03-26 05:55:01,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:55:01,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 409 transitions. [2021-03-26 05:55:01,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 31.46153846153846) internal successors, (409), 13 states have internal predecessors, (409), 0 states have call successors, (0), 0 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 05:55:01,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 63.0) internal successors, (882), 14 states have internal predecessors, (882), 0 states have call successors, (0), 0 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 05:55:01,453 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 63.0) internal successors, (882), 14 states have internal predecessors, (882), 0 states have call successors, (0), 0 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 05:55:01,453 INFO L185 Difference]: Start difference. First operand has 117 places, 118 transitions, 1957 flow. Second operand 13 states and 409 transitions. [2021-03-26 05:55:01,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 243 transitions, 4491 flow [2021-03-26 05:55:01,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 243 transitions, 4072 flow, removed 187 selfloop flow, removed 15 redundant places. [2021-03-26 05:55:01,602 INFO L241 Difference]: Finished difference. Result has 124 places, 127 transitions, 2056 flow [2021-03-26 05:55:01,603 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2056, PETRI_PLACES=124, PETRI_TRANSITIONS=127} [2021-03-26 05:55:01,603 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 87 predicate places. [2021-03-26 05:55:01,603 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:55:01,603 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 127 transitions, 2056 flow [2021-03-26 05:55:01,603 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 127 transitions, 2056 flow [2021-03-26 05:55:01,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 127 transitions, 2056 flow [2021-03-26 05:55:01,700 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][102], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 1025#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 993#(and (= min (select A 0)) (= i 0) (<= (select A 0) max)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1027#(and v_assert (= min (select A 0)) (= i 0) (<= (select A 0) max)), Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), Black: 1029#(and v_assert (<= min max)), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 1031#(and v_assert (<= min max) (= i 0) (<= (select A 0) max)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, 946#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 722#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:01,701 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 05:55:01,701 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:01,701 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:01,701 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:01,706 INFO L129 PetriNetUnfolder]: 809/1379 cut-off events. [2021-03-26 05:55:01,706 INFO L130 PetriNetUnfolder]: For 34592/35439 co-relation queries the response was YES. [2021-03-26 05:55:01,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12291 conditions, 1379 events. 809/1379 cut-off events. For 34592/35439 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7443 event pairs, 136 based on Foata normal form. 26/1274 useless extension candidates. Maximal degree in co-relation 12223. Up to 746 conditions per place. [2021-03-26 05:55:01,728 INFO L142 LiptonReduction]: Number of co-enabled transitions 854 [2021-03-26 05:55:01,733 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:55:01,733 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:55:01,733 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 130 [2021-03-26 05:55:01,734 INFO L480 AbstractCegarLoop]: Abstraction has has 116 places, 127 transitions, 2056 flow [2021-03-26 05:55:01,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 25.416666666666668) internal successors, (305), 12 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 05:55:01,734 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:55:01,734 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:55:01,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-03-26 05:55:01,948 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:55:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:55:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1059831785, now seen corresponding path program 1 times [2021-03-26 05:55:01,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:55:01,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481024132] [2021-03-26 05:55:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:55:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:01,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:01,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:01,985 INFO L142 QuantifierPusher]: treesize reduction 10, result has 71.4 percent of original size [2021-03-26 05:55:01,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 05:55:01,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:01,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:02,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:55:02,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481024132] [2021-03-26 05:55:02,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756116553] [2021-03-26 05:55:02,020 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 05:55:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:02,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2021-03-26 05:55:02,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:55:02,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:02,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:02,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:02,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:02,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:02,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:02,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:02,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 05:55:02,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:02,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:02,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 05:55:02,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,109 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:02,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:02,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 05:55:02,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 11 [2021-03-26 05:55:02,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:02,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:02,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,123 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:02,123 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2021-03-26 05:55:02,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:02,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:02,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 05:55:02,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:02,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:02,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 05:55:02,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:02,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:02,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 05:55:02,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2021-03-26 05:55:02,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,144 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:02,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,146 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:02,147 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2021-03-26 05:55:02,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:02,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:02,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:02,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:02,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:02,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-03-26 05:55:02,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:02,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:02,158 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:02,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:02,160 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:02,160 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-03-26 05:55:02,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:02,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:02,162 INFO L142 QuantifierPusher]: treesize reduction 23, result has 17.9 percent of original size [2021-03-26 05:55:02,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:02,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:02,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:02,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-03-26 05:55:02,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:02,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:55:02,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:55:02,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-03-26 05:55:02,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448717230] [2021-03-26 05:55:02,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 05:55:02,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:55:02,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 05:55:02,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-26 05:55:02,198 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 63 [2021-03-26 05:55:02,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 127 transitions, 2056 flow. Second operand has 9 states, 9 states have (on average 31.444444444444443) internal successors, (283), 9 states have internal predecessors, (283), 0 states have call successors, (0), 0 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 05:55:02,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:55:02,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 63 [2021-03-26 05:55:02,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:55:02,760 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][44], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 1025#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 993#(and (= min (select A 0)) (= i 0) (<= (select A 0) max)), Black: 191#(and (= i 0) (<= j i)), Black: 1027#(and v_assert (= min (select A 0)) (= i 0) (<= (select A 0) max)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), Black: 1029#(and v_assert (<= min max)), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 1031#(and v_assert (<= min max) (= i 0) (<= (select A 0) max)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), 1043#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, 946#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 60#(not b1), 833#true, Black: 446#(<= (+ i 1) N), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 722#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:02,760 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 05:55:02,760 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:02,760 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:02,760 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:02,762 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][44], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 1025#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 993#(and (= min (select A 0)) (= i 0) (<= (select A 0) max)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1027#(and v_assert (= min (select A 0)) (= i 0) (<= (select A 0) max)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 1029#(and v_assert (<= min max)), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 1031#(and v_assert (<= min max) (= i 0) (<= (select A 0) max)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 954#(<= min max), Black: 445#(= l i), 833#true, Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 722#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:02,762 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 05:55:02,762 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:55:02,762 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:02,762 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:55:02,786 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][44], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 1025#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 191#(and (= i 0) (<= j i)), Black: 993#(and (= min (select A 0)) (= i 0) (<= (select A 0) max)), Black: 1027#(and v_assert (= min (select A 0)) (= i 0) (<= (select A 0) max)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 1029#(and v_assert (<= min max)), Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 1031#(and v_assert (<= min max) (= i 0) (<= (select A 0) max)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 954#(<= min max), Black: 445#(= l i), 833#true, Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 722#(and (<= min max) (= i 0) (<= (select A 0) max)), Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:02,786 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 05:55:02,786 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:02,786 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:02,786 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:02,812 INFO L129 PetriNetUnfolder]: 3450/5309 cut-off events. [2021-03-26 05:55:02,812 INFO L130 PetriNetUnfolder]: For 108082/109074 co-relation queries the response was YES. [2021-03-26 05:55:02,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44702 conditions, 5309 events. 3450/5309 cut-off events. For 108082/109074 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 31929 event pairs, 489 based on Foata normal form. 57/5035 useless extension candidates. Maximal degree in co-relation 44617. Up to 2293 conditions per place. [2021-03-26 05:55:02,859 INFO L132 encePairwiseOnDemand]: 53/63 looper letters, 114 selfloop transitions, 45 changer transitions 89/261 dead transitions. [2021-03-26 05:55:02,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 261 transitions, 4704 flow [2021-03-26 05:55:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 05:55:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 05:55:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 401 transitions. [2021-03-26 05:55:02,860 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5786435786435786 [2021-03-26 05:55:02,860 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 401 transitions. [2021-03-26 05:55:02,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 401 transitions. [2021-03-26 05:55:02,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:55:02,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 401 transitions. [2021-03-26 05:55:02,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 36.45454545454545) internal successors, (401), 11 states have internal predecessors, (401), 0 states have call successors, (0), 0 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 05:55:02,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 63.0) internal successors, (756), 12 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:55:02,862 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 63.0) internal successors, (756), 12 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:55:02,863 INFO L185 Difference]: Start difference. First operand has 116 places, 127 transitions, 2056 flow. Second operand 11 states and 401 transitions. [2021-03-26 05:55:02,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 261 transitions, 4704 flow [2021-03-26 05:55:03,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 261 transitions, 4513 flow, removed 89 selfloop flow, removed 7 redundant places. [2021-03-26 05:55:03,029 INFO L241 Difference]: Finished difference. Result has 125 places, 142 transitions, 2400 flow [2021-03-26 05:55:03,029 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2400, PETRI_PLACES=125, PETRI_TRANSITIONS=142} [2021-03-26 05:55:03,029 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 88 predicate places. [2021-03-26 05:55:03,029 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:55:03,030 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 142 transitions, 2400 flow [2021-03-26 05:55:03,030 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 142 transitions, 2400 flow [2021-03-26 05:55:03,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 142 transitions, 2400 flow [2021-03-26 05:55:03,145 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][40], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 954#(<= min max), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 1121#(and v_assert (<= min max) (<= min (select A 0))), Black: 1123#(and v_assert (<= min max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 1049#(<= min max), Black: 714#(and v_assert (= min max)), Black: 1119#(and (<= min max) (<= min (select A 0))), Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:03,145 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 05:55:03,145 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:03,145 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:03,145 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:55:03,157 INFO L129 PetriNetUnfolder]: 988/1697 cut-off events. [2021-03-26 05:55:03,157 INFO L130 PetriNetUnfolder]: For 44693/45591 co-relation queries the response was YES. [2021-03-26 05:55:03,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15249 conditions, 1697 events. 988/1697 cut-off events. For 44693/45591 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 9605 event pairs, 137 based on Foata normal form. 54/1579 useless extension candidates. Maximal degree in co-relation 15165. Up to 912 conditions per place. [2021-03-26 05:55:03,183 INFO L142 LiptonReduction]: Number of co-enabled transitions 982 [2021-03-26 05:55:03,187 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:55:03,187 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:55:03,188 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 159 [2021-03-26 05:55:03,188 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 142 transitions, 2400 flow [2021-03-26 05:55:03,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 31.444444444444443) internal successors, (283), 9 states have internal predecessors, (283), 0 states have call successors, (0), 0 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 05:55:03,188 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:55:03,189 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:55:03,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-03-26 05:55:03,404 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:55:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:55:03,404 INFO L82 PathProgramCache]: Analyzing trace with hash -987606507, now seen corresponding path program 2 times [2021-03-26 05:55:03,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:55:03,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458801140] [2021-03-26 05:55:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:55:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:03,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:03,428 INFO L142 QuantifierPusher]: treesize reduction 14, result has 56.3 percent of original size [2021-03-26 05:55:03,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:03,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-03-26 05:55:03,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458801140] [2021-03-26 05:55:03,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296301676] [2021-03-26 05:55:03,452 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 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 05:55:03,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-26 05:55:03,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 05:55:03,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2021-03-26 05:55:03,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:55:03,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:03,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:03,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:03,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:03,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:03,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:03,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:03,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:03,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,538 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:03,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:03,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 05:55:03,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:03,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:03,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 05:55:03,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:03,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:03,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 05:55:03,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-03-26 05:55:03,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,554 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:03,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,556 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:03,556 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2021-03-26 05:55:03,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:03,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,559 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:03,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:03,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:03,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,563 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:03,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:03,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:03,566 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 05:55:03,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,570 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:03,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:03,572 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-03-26 05:55:03,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,577 INFO L142 QuantifierPusher]: treesize reduction 23, result has 23.3 percent of original size [2021-03-26 05:55:03,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:03,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:03,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:03,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:55:03,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:03,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-03-26 05:55:03,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:55:03,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-03-26 05:55:03,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388271741] [2021-03-26 05:55:03,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 05:55:03,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:55:03,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 05:55:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-26 05:55:03,601 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 63 [2021-03-26 05:55:03,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 142 transitions, 2400 flow. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:55:03,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:55:03,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 63 [2021-03-26 05:55:03,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:55:04,231 INFO L129 PetriNetUnfolder]: 2933/4755 cut-off events. [2021-03-26 05:55:04,231 INFO L130 PetriNetUnfolder]: For 105749/107258 co-relation queries the response was YES. [2021-03-26 05:55:04,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41644 conditions, 4755 events. 2933/4755 cut-off events. For 105749/107258 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 30406 event pairs, 431 based on Foata normal form. 82/4425 useless extension candidates. Maximal degree in co-relation 41549. Up to 2296 conditions per place. [2021-03-26 05:55:04,272 INFO L132 encePairwiseOnDemand]: 53/63 looper letters, 113 selfloop transitions, 56 changer transitions 103/286 dead transitions. [2021-03-26 05:55:04,272 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 286 transitions, 5468 flow [2021-03-26 05:55:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 05:55:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 05:55:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 391 transitions. [2021-03-26 05:55:04,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6206349206349207 [2021-03-26 05:55:04,275 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 391 transitions. [2021-03-26 05:55:04,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 391 transitions. [2021-03-26 05:55:04,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:55:04,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 391 transitions. [2021-03-26 05:55:04,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 39.1) internal successors, (391), 10 states have internal predecessors, (391), 0 states have call successors, (0), 0 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 05:55:04,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 63.0) internal successors, (693), 11 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 05:55:04,277 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 63.0) internal successors, (693), 11 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 05:55:04,277 INFO L185 Difference]: Start difference. First operand has 121 places, 142 transitions, 2400 flow. Second operand 10 states and 391 transitions. [2021-03-26 05:55:04,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 286 transitions, 5468 flow [2021-03-26 05:55:04,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 286 transitions, 5369 flow, removed 42 selfloop flow, removed 6 redundant places. [2021-03-26 05:55:04,349 INFO L241 Difference]: Finished difference. Result has 130 places, 144 transitions, 2646 flow [2021-03-26 05:55:04,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2646, PETRI_PLACES=130, PETRI_TRANSITIONS=144} [2021-03-26 05:55:04,349 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 93 predicate places. [2021-03-26 05:55:04,349 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:55:04,349 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 144 transitions, 2646 flow [2021-03-26 05:55:04,349 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 144 transitions, 2646 flow [2021-03-26 05:55:04,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 144 transitions, 2646 flow [2021-03-26 05:55:04,494 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][129], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), 1043#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1136#(<= min (+ max 1)), Black: 1206#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1208#(and v_assert (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1210#(and v_assert (<= min (+ max 1))), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 1119#(and (<= min max) (<= min (select A 0))), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:04,494 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 05:55:04,494 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:04,494 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:04,494 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:04,506 INFO L129 PetriNetUnfolder]: 1094/1868 cut-off events. [2021-03-26 05:55:04,507 INFO L130 PetriNetUnfolder]: For 66941/68698 co-relation queries the response was YES. [2021-03-26 05:55:04,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18496 conditions, 1868 events. 1094/1868 cut-off events. For 66941/68698 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 10681 event pairs, 163 based on Foata normal form. 71/1745 useless extension candidates. Maximal degree in co-relation 18220. Up to 1015 conditions per place. [2021-03-26 05:55:04,546 INFO L142 LiptonReduction]: Number of co-enabled transitions 990 [2021-03-26 05:55:04,553 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:55:04,553 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:55:04,553 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 204 [2021-03-26 05:55:04,553 INFO L480 AbstractCegarLoop]: Abstraction has has 130 places, 144 transitions, 2646 flow [2021-03-26 05:55:04,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:55:04,554 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:55:04,554 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:55:04,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:55:04,761 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:55:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:55:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash 886293845, now seen corresponding path program 2 times [2021-03-26 05:55:04,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:55:04,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017312145] [2021-03-26 05:55:04,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:55:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:04,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:04,803 INFO L142 QuantifierPusher]: treesize reduction 28, result has 69.6 percent of original size [2021-03-26 05:55:04,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-26 05:55:04,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 05:55:04,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:04,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:04,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 05:55:04,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017312145] [2021-03-26 05:55:04,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530050965] [2021-03-26 05:55:04,859 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 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 05:55:04,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-26 05:55:04,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 05:55:04,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2021-03-26 05:55:04,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:55:04,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:04,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:04,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:55:04,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:55:04,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:55:04,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 05:55:04,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 05:55:04,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 05:55:04,917 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-26 05:55:04,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 05:55:04,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 05:55:04,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:04,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 05:55:04,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 05:55:04,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:04,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:04,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 05:55:04,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,942 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:04,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:04,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 05:55:04,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-03-26 05:55:04,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:04,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:04,948 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:04,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,953 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:04,953 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2021-03-26 05:55:04,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:04,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:04,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 05:55:04,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:04,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:04,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 05:55:04,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,967 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:04,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:04,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 05:55:04,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2021-03-26 05:55:04,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:04,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:04,973 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:04,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:04,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:04,976 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2021-03-26 05:55:04,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:04,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:04,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,979 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:04,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:04,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:04,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:04,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-03-26 05:55:04,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:04,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:04,989 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:04,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:04,991 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:04,991 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-03-26 05:55:04,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:04,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:04,993 INFO L142 QuantifierPusher]: treesize reduction 23, result has 17.9 percent of original size [2021-03-26 05:55:04,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:04,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,994 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:04,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:04,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-03-26 05:55:04,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:04,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:04,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:04,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:04,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:04,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:04,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:05,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 05:55:05,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:55:05,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-03-26 05:55:05,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437333824] [2021-03-26 05:55:05,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 05:55:05,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:55:05,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 05:55:05,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-26 05:55:05,021 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 63 [2021-03-26 05:55:05,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 144 transitions, 2646 flow. Second operand has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 0 states have call successors, (0), 0 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 05:55:05,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:55:05,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 63 [2021-03-26 05:55:05,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:55:05,867 INFO L129 PetriNetUnfolder]: 4812/7178 cut-off events. [2021-03-26 05:55:05,867 INFO L130 PetriNetUnfolder]: For 162725/162897 co-relation queries the response was YES. [2021-03-26 05:55:05,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62216 conditions, 7178 events. 4812/7178 cut-off events. For 162725/162897 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 42472 event pairs, 1004 based on Foata normal form. 38/6868 useless extension candidates. Maximal degree in co-relation 61431. Up to 3469 conditions per place. [2021-03-26 05:55:05,932 INFO L132 encePairwiseOnDemand]: 52/63 looper letters, 124 selfloop transitions, 27 changer transitions 100/263 dead transitions. [2021-03-26 05:55:05,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 263 transitions, 5263 flow [2021-03-26 05:55:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 05:55:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 05:55:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 372 transitions. [2021-03-26 05:55:05,933 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5367965367965368 [2021-03-26 05:55:05,933 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 372 transitions. [2021-03-26 05:55:05,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 372 transitions. [2021-03-26 05:55:05,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:55:05,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 372 transitions. [2021-03-26 05:55:05,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 33.81818181818182) internal successors, (372), 11 states have internal predecessors, (372), 0 states have call successors, (0), 0 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 05:55:05,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 63.0) internal successors, (756), 12 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:55:05,935 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 63.0) internal successors, (756), 12 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:55:05,935 INFO L185 Difference]: Start difference. First operand has 130 places, 144 transitions, 2646 flow. Second operand 11 states and 372 transitions. [2021-03-26 05:55:05,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 263 transitions, 5263 flow [2021-03-26 05:55:06,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 263 transitions, 5169 flow, removed 47 selfloop flow, removed 1 redundant places. [2021-03-26 05:55:06,123 INFO L241 Difference]: Finished difference. Result has 144 places, 142 transitions, 2637 flow [2021-03-26 05:55:06,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2588, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2637, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2021-03-26 05:55:06,123 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 107 predicate places. [2021-03-26 05:55:06,123 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:55:06,123 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 142 transitions, 2637 flow [2021-03-26 05:55:06,124 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 142 transitions, 2637 flow [2021-03-26 05:55:06,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 136 places, 142 transitions, 2637 flow [2021-03-26 05:55:06,288 INFO L129 PetriNetUnfolder]: 1149/1965 cut-off events. [2021-03-26 05:55:06,289 INFO L130 PetriNetUnfolder]: For 75135/76903 co-relation queries the response was YES. [2021-03-26 05:55:06,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20045 conditions, 1965 events. 1149/1965 cut-off events. For 75135/76903 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 11381 event pairs, 187 based on Foata normal form. 60/1809 useless extension candidates. Maximal degree in co-relation 19917. Up to 1074 conditions per place. [2021-03-26 05:55:06,322 INFO L142 LiptonReduction]: Number of co-enabled transitions 974 [2021-03-26 05:55:06,327 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:55:06,327 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:55:06,327 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 204 [2021-03-26 05:55:06,328 INFO L480 AbstractCegarLoop]: Abstraction has has 136 places, 142 transitions, 2637 flow [2021-03-26 05:55:06,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 0 states have call successors, (0), 0 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 05:55:06,328 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:55:06,328 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:55:06,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:55:06,547 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:55:06,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:55:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash 277392219, now seen corresponding path program 1 times [2021-03-26 05:55:06,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:55:06,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510760387] [2021-03-26 05:55:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:55:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:06,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,565 INFO L142 QuantifierPusher]: treesize reduction 14, result has 56.3 percent of original size [2021-03-26 05:55:06,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 05:55:06,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:06,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-03-26 05:55:06,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510760387] [2021-03-26 05:55:06,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175978964] [2021-03-26 05:55:06,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:55:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:06,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2021-03-26 05:55:06,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:55:06,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:06,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:06,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:06,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:06,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:06,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:06,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:06,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:06,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 05:55:06,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,659 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:06,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:06,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 05:55:06,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:06,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 05:55:06,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 05:55:06,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-03-26 05:55:06,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:06,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:06,666 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:06,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:06,668 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:06,669 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2021-03-26 05:55:06,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:06,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:06,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:06,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:06,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:06,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:06,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:06,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 05:55:06,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 05:55:06,675 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 05:55:06,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-26 05:55:06,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,679 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-26 05:55:06,679 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-03-26 05:55:06,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,687 INFO L142 QuantifierPusher]: treesize reduction 23, result has 23.3 percent of original size [2021-03-26 05:55:06,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:06,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:06,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:06,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:55:06,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:06,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-03-26 05:55:06,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:55:06,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-03-26 05:55:06,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768062025] [2021-03-26 05:55:06,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 05:55:06,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:55:06,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 05:55:06,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-26 05:55:06,710 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 63 [2021-03-26 05:55:06,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 142 transitions, 2637 flow. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:55:06,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:55:06,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 63 [2021-03-26 05:55:06,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:55:07,224 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][108], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), 1043#true, Black: 1296#(and v_assert (<= min max) (<= (select A 0) max)), Black: 1298#(and v_assert (<= min max)), Black: 1224#(<= (select A 0) max), Black: 1225#(<= min max), Black: 1294#(and (<= min max) (<= (select A 0) max)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1136#(<= min (+ max 1)), Black: 1206#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1208#(and v_assert (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1210#(and v_assert (<= min (+ max 1))), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:07,224 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,224 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,224 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,224 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,228 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][279], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, Black: 1296#(and v_assert (<= min max) (<= (select A 0) max)), Black: 1298#(and v_assert (<= min max)), Black: 1224#(<= (select A 0) max), Black: 1225#(<= min max), Black: 1294#(and (<= min max) (<= (select A 0) max)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 954#(<= min max), Black: 1136#(<= min (+ max 1)), Black: 1206#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1208#(and v_assert (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1210#(and v_assert (<= min (+ max 1))), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 1218#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), 1382#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:07,228 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,228 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,228 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,228 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,233 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][282], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), 1043#true, Black: 1296#(and v_assert (<= min max) (<= (select A 0) max)), Black: 1298#(and v_assert (<= min max)), Black: 1224#(<= (select A 0) max), Black: 1225#(<= min max), Black: 1294#(and (<= min max) (<= (select A 0) max)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1136#(<= min (+ max 1)), Black: 1206#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1208#(and v_assert (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1210#(and v_assert (<= min (+ max 1))), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 1218#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), 1384#(and v_assert (<= min (+ max 1))), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:07,233 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,233 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,233 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,233 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,242 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][67], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), 1043#true, Black: 1296#(and v_assert (<= min max) (<= (select A 0) max)), Black: 1298#(and v_assert (<= min max)), Black: 1224#(<= (select A 0) max), Black: 1225#(<= min max), Black: 1294#(and (<= min max) (<= (select A 0) max)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1136#(<= min (+ max 1)), Black: 1206#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1208#(and v_assert (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1210#(and v_assert (<= min (+ max 1))), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:07,242 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,243 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,243 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,243 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,245 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][302], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 948#(and (= k 0) (= l k) (= i 0) (= j 0)), 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, Black: 1296#(and v_assert (<= min max) (<= (select A 0) max)), Black: 1298#(and v_assert (<= min max)), Black: 1224#(<= (select A 0) max), Black: 1225#(<= min max), Black: 1294#(and (<= min max) (<= (select A 0) max)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 954#(<= min max), Black: 1136#(<= min (+ max 1)), Black: 1206#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1208#(and v_assert (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1210#(and v_assert (<= min (+ max 1))), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), 1218#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), 1384#(and v_assert (<= min (+ max 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:07,245 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,245 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,245 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,245 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,272 INFO L129 PetriNetUnfolder]: 2825/4538 cut-off events. [2021-03-26 05:55:07,273 INFO L130 PetriNetUnfolder]: For 137771/139139 co-relation queries the response was YES. [2021-03-26 05:55:07,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45767 conditions, 4538 events. 2825/4538 cut-off events. For 137771/139139 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 28462 event pairs, 319 based on Foata normal form. 42/4133 useless extension candidates. Maximal degree in co-relation 45619. Up to 2320 conditions per place. [2021-03-26 05:55:07,314 INFO L132 encePairwiseOnDemand]: 52/63 looper letters, 124 selfloop transitions, 39 changer transitions 144/321 dead transitions. [2021-03-26 05:55:07,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 321 transitions, 6788 flow [2021-03-26 05:55:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 05:55:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 05:55:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 393 transitions. [2021-03-26 05:55:07,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6238095238095238 [2021-03-26 05:55:07,315 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 393 transitions. [2021-03-26 05:55:07,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 393 transitions. [2021-03-26 05:55:07,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:55:07,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 393 transitions. [2021-03-26 05:55:07,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 39.3) internal successors, (393), 10 states have internal predecessors, (393), 0 states have call successors, (0), 0 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 05:55:07,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 63.0) internal successors, (693), 11 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 05:55:07,317 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 63.0) internal successors, (693), 11 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 05:55:07,317 INFO L185 Difference]: Start difference. First operand has 136 places, 142 transitions, 2637 flow. Second operand 10 states and 393 transitions. [2021-03-26 05:55:07,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 321 transitions, 6788 flow [2021-03-26 05:55:07,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 321 transitions, 6496 flow, removed 135 selfloop flow, removed 12 redundant places. [2021-03-26 05:55:07,460 INFO L241 Difference]: Finished difference. Result has 139 places, 143 transitions, 2664 flow [2021-03-26 05:55:07,460 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2521, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2664, PETRI_PLACES=139, PETRI_TRANSITIONS=143} [2021-03-26 05:55:07,460 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 102 predicate places. [2021-03-26 05:55:07,460 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:55:07,460 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 143 transitions, 2664 flow [2021-03-26 05:55:07,461 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 143 transitions, 2664 flow [2021-03-26 05:55:07,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 143 transitions, 2664 flow [2021-03-26 05:55:07,572 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][48], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), 1043#true, Black: 1224#(<= (select A 0) max), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 1218#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 1380#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 1382#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1384#(and v_assert (<= min (+ max 1))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 1310#(<= min (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:07,572 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 05:55:07,572 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:07,572 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:07,572 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,592 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][48], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), 1043#true, Black: 1224#(<= (select A 0) max), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 1380#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), 1131#true, Black: 1382#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 716#(and (= i 0) (= max (select A 0))), Black: 1384#(and v_assert (<= min (+ max 1))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 1310#(<= min (+ max 1)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:07,592 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-26 05:55:07,592 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:07,592 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:07,592 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:07,592 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:07,605 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][48], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), 1043#true, Black: 1224#(<= (select A 0) max), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 1380#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 1382#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1384#(and v_assert (<= min (+ max 1))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 1310#(<= min (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:07,605 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,605 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,605 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,606 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,615 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][48], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 954#(<= min max), 1043#true, Black: 1224#(<= (select A 0) max), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 32#thread3EXITtrue, 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 1380#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 1382#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1384#(and v_assert (<= min (+ max 1))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 1310#(<= min (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:07,615 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,615 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,615 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,615 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,615 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:07,630 INFO L129 PetriNetUnfolder]: 1174/2039 cut-off events. [2021-03-26 05:55:07,630 INFO L130 PetriNetUnfolder]: For 66944/68337 co-relation queries the response was YES. [2021-03-26 05:55:07,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19771 conditions, 2039 events. 1174/2039 cut-off events. For 66944/68337 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 12079 event pairs, 206 based on Foata normal form. 74/1864 useless extension candidates. Maximal degree in co-relation 19668. Up to 1112 conditions per place. [2021-03-26 05:55:07,703 INFO L142 LiptonReduction]: Number of co-enabled transitions 996 [2021-03-26 05:55:07,708 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:55:07,709 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:55:07,709 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 249 [2021-03-26 05:55:07,709 INFO L480 AbstractCegarLoop]: Abstraction has has 134 places, 143 transitions, 2664 flow [2021-03-26 05:55:07,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 05:55:07,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:55:07,709 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:55:07,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-03-26 05:55:07,915 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:55:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:55:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1191889507, now seen corresponding path program 3 times [2021-03-26 05:55:07,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:55:07,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597513507] [2021-03-26 05:55:07,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:55:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:07,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:07,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:07,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:07,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:07,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:07,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:07,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:07,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:07,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:07,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:55:07,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597513507] [2021-03-26 05:55:07,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283807402] [2021-03-26 05:55:07,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:55:08,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-26 05:55:08,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 05:55:08,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-26 05:55:08,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:55:08,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:08,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,015 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:08,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:08,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:55:08,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:08,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:08,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:08,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:08,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:08,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:08,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:08,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:08,042 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-26 05:55:08,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:08,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:08,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:08,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:08,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:08,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:08,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:08,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:08,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:08,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:08,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:08,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:08,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:08,058 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-26 05:55:08,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:08,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:55:08,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:55:08,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-03-26 05:55:08,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468715572] [2021-03-26 05:55:08,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 05:55:08,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:55:08,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 05:55:08,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 05:55:08,084 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 63 [2021-03-26 05:55:08,084 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 143 transitions, 2664 flow. Second operand has 7 states, 7 states have (on average 40.714285714285715) internal successors, (285), 7 states have internal predecessors, (285), 0 states have call successors, (0), 0 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 05:55:08,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:55:08,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 63 [2021-03-26 05:55:08,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:55:09,237 INFO L129 PetriNetUnfolder]: 7750/10907 cut-off events. [2021-03-26 05:55:09,237 INFO L130 PetriNetUnfolder]: For 287190/287734 co-relation queries the response was YES. [2021-03-26 05:55:09,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97234 conditions, 10907 events. 7750/10907 cut-off events. For 287190/287734 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 59827 event pairs, 507 based on Foata normal form. 352/11116 useless extension candidates. Maximal degree in co-relation 97067. Up to 4323 conditions per place. [2021-03-26 05:55:09,347 INFO L132 encePairwiseOnDemand]: 58/63 looper letters, 256 selfloop transitions, 108 changer transitions 18/410 dead transitions. [2021-03-26 05:55:09,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 410 transitions, 8135 flow [2021-03-26 05:55:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 05:55:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 05:55:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 408 transitions. [2021-03-26 05:55:09,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7195767195767195 [2021-03-26 05:55:09,349 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 408 transitions. [2021-03-26 05:55:09,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 408 transitions. [2021-03-26 05:55:09,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:55:09,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 408 transitions. [2021-03-26 05:55:09,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 45.333333333333336) internal successors, (408), 9 states have internal predecessors, (408), 0 states have call successors, (0), 0 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 05:55:09,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 63.0) internal successors, (630), 10 states have internal predecessors, (630), 0 states have call successors, (0), 0 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 05:55:09,350 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 63.0) internal successors, (630), 10 states have internal predecessors, (630), 0 states have call successors, (0), 0 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 05:55:09,350 INFO L185 Difference]: Start difference. First operand has 134 places, 143 transitions, 2664 flow. Second operand 9 states and 408 transitions. [2021-03-26 05:55:09,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 410 transitions, 8135 flow [2021-03-26 05:55:09,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 410 transitions, 7905 flow, removed 115 selfloop flow, removed 5 redundant places. [2021-03-26 05:55:09,677 INFO L241 Difference]: Finished difference. Result has 141 places, 241 transitions, 5097 flow [2021-03-26 05:55:09,677 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5097, PETRI_PLACES=141, PETRI_TRANSITIONS=241} [2021-03-26 05:55:09,677 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 104 predicate places. [2021-03-26 05:55:09,677 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:55:09,677 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 241 transitions, 5097 flow [2021-03-26 05:55:09,677 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 241 transitions, 5097 flow [2021-03-26 05:55:09,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 141 places, 241 transitions, 5097 flow [2021-03-26 05:55:10,162 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][87], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, Black: 1224#(<= (select A 0) max), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 839#(<= min (select A 0)), 1309#(<= (select A 0) (+ max 1)), 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:10,162 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:10,163 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:10,163 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:10,163 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:10,168 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][87], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, Black: 1224#(<= (select A 0) max), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 839#(<= min (select A 0)), 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:10,168 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:55:10,168 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:10,168 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:10,168 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:10,203 INFO L129 PetriNetUnfolder]: 3026/5278 cut-off events. [2021-03-26 05:55:10,203 INFO L130 PetriNetUnfolder]: For 169674/171867 co-relation queries the response was YES. [2021-03-26 05:55:10,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49542 conditions, 5278 events. 3026/5278 cut-off events. For 169674/171867 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 37793 event pairs, 437 based on Foata normal form. 113/4871 useless extension candidates. Maximal degree in co-relation 48809. Up to 2529 conditions per place. [2021-03-26 05:55:10,315 INFO L142 LiptonReduction]: Number of co-enabled transitions 2034 [2021-03-26 05:55:10,327 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:55:10,327 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:55:10,327 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 650 [2021-03-26 05:55:10,328 INFO L480 AbstractCegarLoop]: Abstraction has has 141 places, 241 transitions, 5097 flow [2021-03-26 05:55:10,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 40.714285714285715) internal successors, (285), 7 states have internal predecessors, (285), 0 states have call successors, (0), 0 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 05:55:10,328 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:55:10,328 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:55:10,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:55:10,528 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:55:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:55:10,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1569063707, now seen corresponding path program 4 times [2021-03-26 05:55:10,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:55:10,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059390329] [2021-03-26 05:55:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:55:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:10,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:10,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,564 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 05:55:10,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059390329] [2021-03-26 05:55:10,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319633903] [2021-03-26 05:55:10,564 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:55:10,615 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-26 05:55:10,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 05:55:10,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-26 05:55:10,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:55:10,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:10,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:10,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:10,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:55:10,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:10,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:10,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:10,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:10,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:10,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:10,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:10,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:10,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:10,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:10,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:10,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:10,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:10,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:10,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:10,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:10,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,664 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:10,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:10,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:10,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:10,666 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-26 05:55:10,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:10,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 05:55:10,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:55:10,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-03-26 05:55:10,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314739195] [2021-03-26 05:55:10,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 05:55:10,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:55:10,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 05:55:10,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 05:55:10,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 63 [2021-03-26 05:55:10,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 241 transitions, 5097 flow. Second operand has 7 states, 7 states have (on average 40.857142857142854) internal successors, (286), 7 states have internal predecessors, (286), 0 states have call successors, (0), 0 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 05:55:10,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:55:10,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 63 [2021-03-26 05:55:10,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:55:15,334 INFO L129 PetriNetUnfolder]: 20512/30056 cut-off events. [2021-03-26 05:55:15,335 INFO L130 PetriNetUnfolder]: For 798765/800703 co-relation queries the response was YES. [2021-03-26 05:55:15,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 280806 conditions, 30056 events. 20512/30056 cut-off events. For 798765/800703 co-relation queries the response was YES. Maximal size of possible extension queue 1700. Compared 202965 event pairs, 2443 based on Foata normal form. 2162/31662 useless extension candidates. Maximal degree in co-relation 278513. Up to 12280 conditions per place. [2021-03-26 05:55:15,817 INFO L132 encePairwiseOnDemand]: 58/63 looper letters, 399 selfloop transitions, 131 changer transitions 3/561 dead transitions. [2021-03-26 05:55:15,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 561 transitions, 12854 flow [2021-03-26 05:55:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 05:55:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 05:55:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 320 transitions. [2021-03-26 05:55:15,818 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7256235827664399 [2021-03-26 05:55:15,818 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 320 transitions. [2021-03-26 05:55:15,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 320 transitions. [2021-03-26 05:55:15,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:55:15,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 320 transitions. [2021-03-26 05:55:15,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 0 states have call successors, (0), 0 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 05:55:15,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 63.0) internal successors, (504), 8 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 05:55:15,819 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 63.0) internal successors, (504), 8 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 05:55:15,819 INFO L185 Difference]: Start difference. First operand has 141 places, 241 transitions, 5097 flow. Second operand 7 states and 320 transitions. [2021-03-26 05:55:15,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 561 transitions, 12854 flow [2021-03-26 05:55:17,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 561 transitions, 12479 flow, removed 182 selfloop flow, removed 1 redundant places. [2021-03-26 05:55:17,030 INFO L241 Difference]: Finished difference. Result has 150 places, 332 transitions, 7836 flow [2021-03-26 05:55:17,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=4976, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7836, PETRI_PLACES=150, PETRI_TRANSITIONS=332} [2021-03-26 05:55:17,030 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 113 predicate places. [2021-03-26 05:55:17,030 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:55:17,030 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 332 transitions, 7836 flow [2021-03-26 05:55:17,030 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 332 transitions, 7836 flow [2021-03-26 05:55:17,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 150 places, 332 transitions, 7836 flow [2021-03-26 05:55:18,103 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][130], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), 21#L40-1true, Black: 1224#(<= (select A 0) max), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:18,104 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 05:55:18,104 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:55:18,104 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:55:18,104 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:19,233 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][167], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), 21#L40-1true, Black: 1224#(<= (select A 0) max), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:19,233 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:55:19,233 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:19,233 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:19,233 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:19,327 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][167], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), 1043#true, 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1224#(<= (select A 0) max), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), 34#L83true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:19,327 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:55:19,327 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:19,327 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:19,327 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:19,489 INFO L129 PetriNetUnfolder]: 10067/17344 cut-off events. [2021-03-26 05:55:19,490 INFO L130 PetriNetUnfolder]: For 581018/588264 co-relation queries the response was YES. [2021-03-26 05:55:19,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162205 conditions, 17344 events. 10067/17344 cut-off events. For 581018/588264 co-relation queries the response was YES. Maximal size of possible extension queue 1416. Compared 145929 event pairs, 1567 based on Foata normal form. 312/15896 useless extension candidates. Maximal degree in co-relation 159808. Up to 7838 conditions per place. [2021-03-26 05:55:20,075 INFO L142 LiptonReduction]: Number of co-enabled transitions 2972 [2021-03-26 05:55:20,099 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:55:20,099 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:55:20,099 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3069 [2021-03-26 05:55:20,099 INFO L480 AbstractCegarLoop]: Abstraction has has 150 places, 332 transitions, 7836 flow [2021-03-26 05:55:20,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 40.857142857142854) internal successors, (286), 7 states have internal predecessors, (286), 0 states have call successors, (0), 0 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 05:55:20,100 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:55:20,100 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:55:20,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-03-26 05:55:20,314 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:55:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:55:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1740758254, now seen corresponding path program 2 times [2021-03-26 05:55:20,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:55:20,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840334152] [2021-03-26 05:55:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:55:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:55:20,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:20,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:55:20,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840334152] [2021-03-26 05:55:20,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270737277] [2021-03-26 05:55:20,343 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 05:55:20,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-26 05:55:20,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 05:55:20,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-26 05:55:20,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:55:20,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:20,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:20,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:55:20,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:55:20,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:20,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:20,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:20,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,405 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:20,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:20,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:20,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:20,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:20,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:20,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:20,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:55:20,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:55:20,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:55:20,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:20,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:20,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:20,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:55:20,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:55:20,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:55:20,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:55:20,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:55:20,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:55:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-03-26 05:55:20,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:55:20,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-26 05:55:20,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550748893] [2021-03-26 05:55:20,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 05:55:20,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:55:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 05:55:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-26 05:55:20,540 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 63 [2021-03-26 05:55:20,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 332 transitions, 7836 flow. Second operand has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 0 states have call successors, (0), 0 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 05:55:20,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:55:20,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 63 [2021-03-26 05:55:20,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:55:36,115 INFO L129 PetriNetUnfolder]: 56237/81014 cut-off events. [2021-03-26 05:55:36,115 INFO L130 PetriNetUnfolder]: For 2611721/2615607 co-relation queries the response was YES. [2021-03-26 05:55:36,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 843345 conditions, 81014 events. 56237/81014 cut-off events. For 2611721/2615607 co-relation queries the response was YES. Maximal size of possible extension queue 4378. Compared 599563 event pairs, 5575 based on Foata normal form. 10906/91199 useless extension candidates. Maximal degree in co-relation 839148. Up to 38187 conditions per place. [2021-03-26 05:55:37,487 INFO L132 encePairwiseOnDemand]: 56/63 looper letters, 712 selfloop transitions, 804 changer transitions 5/1549 dead transitions. [2021-03-26 05:55:37,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1549 transitions, 42632 flow [2021-03-26 05:55:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-03-26 05:55:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-03-26 05:55:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1039 transitions. [2021-03-26 05:55:37,489 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7170462387853692 [2021-03-26 05:55:37,489 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1039 transitions. [2021-03-26 05:55:37,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1039 transitions. [2021-03-26 05:55:37,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:55:37,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1039 transitions. [2021-03-26 05:55:37,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 45.17391304347826) internal successors, (1039), 23 states have internal predecessors, (1039), 0 states have call successors, (0), 0 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 05:55:37,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 63.0) internal successors, (1512), 24 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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 05:55:37,492 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 63.0) internal successors, (1512), 24 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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 05:55:37,492 INFO L185 Difference]: Start difference. First operand has 150 places, 332 transitions, 7836 flow. Second operand 23 states and 1039 transitions. [2021-03-26 05:55:37,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1549 transitions, 42632 flow [2021-03-26 05:55:44,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 1549 transitions, 41325 flow, removed 637 selfloop flow, removed 1 redundant places. [2021-03-26 05:55:44,024 INFO L241 Difference]: Finished difference. Result has 189 places, 1151 transitions, 34383 flow [2021-03-26 05:55:44,024 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=7669, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=34383, PETRI_PLACES=189, PETRI_TRANSITIONS=1151} [2021-03-26 05:55:44,024 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 152 predicate places. [2021-03-26 05:55:44,024 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:55:44,024 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 1151 transitions, 34383 flow [2021-03-26 05:55:44,025 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 1151 transitions, 34383 flow [2021-03-26 05:55:44,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 189 places, 1151 transitions, 34383 flow [2021-03-26 05:55:51,380 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_15 (+ v_max_16 1)))) (or (and (or (not v_b2_6) (not v_b1_6) .cse0) v_v_assert_8) (and v_b2_6 (not v_v_assert_8) v_b1_6 (not .cse0)))) InVars {b2=v_b2_6, b1=v_b1_6, min=v_min_15, max=v_max_16} OutVars{b2=v_b2_6, b1=v_b1_6, v_assert=v_v_assert_8, min=v_min_15, max=v_max_16} AuxVars[] AssignedVars[v_assert][142], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1048#(<= min (select A 0)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1571#(<= (+ i 1) N), Black: 546#(and (<= k i) (<= (+ k 1) N)), 38#thread4EXITtrue, 427#(<= N l), 44#L27-1true, Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), 839#(<= min (select A 0)), 1479#true, Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), 1135#(<= min (+ (select A 0) 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 122#(<= min (select A 0))]) [2021-03-26 05:55:51,380 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:55:51,380 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:51,380 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:51,380 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:55:51,380 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([137] L27-1-->L27-1: Formula: (and (= v_i_13 (+ v_i_14 1)) (= v_min_9 (let ((.cse0 (select v_A_31 v_i_14))) (ite (< v_min_10 .cse0) v_min_10 .cse0))) (< v_i_14 v_N_17)) InVars {A=v_A_31, N=v_N_17, i=v_i_14, min=v_min_10} OutVars{A=v_A_31, N=v_N_17, i=v_i_13, min=v_min_9} AuxVars[] AssignedVars[i, min][298], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1048#(<= min (select A 0)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 38#thread4EXITtrue, 427#(<= N l), 44#L27-1true, Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), 839#(<= min (select A 0)), 1479#true, Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), 1135#(<= min (+ (select A 0) 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 122#(<= min (select A 0))]) [2021-03-26 05:55:51,380 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:51,380 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-26 05:55:51,380 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-26 05:55:51,380 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:51,682 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][866], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:51,682 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:51,682 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:51,682 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:51,682 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:52,936 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][385], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:52,937 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:52,937 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:52,937 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:52,937 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:52,967 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][731], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 10#L82true, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:52,967 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:52,967 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:52,967 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-26 05:55:52,967 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,554 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][878], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:54,555 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,555 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,555 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,555 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,555 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][136], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), 1473#(and (<= N l) (<= k (+ l 1))), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:54,555 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,555 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,555 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,555 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,753 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1080], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:54,753 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:55:54,753 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,753 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,753 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,931 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][264], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:54,931 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,931 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,931 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,931 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,931 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][264], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:54,931 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:55:54,931 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,931 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:54,931 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:54,947 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][731], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 8#L51-1true, 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:54,947 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:55:54,948 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,948 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:55:54,948 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,960 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][154], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 1473#(and (<= N l) (<= k (+ l 1))), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:54,961 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:55:54,961 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,961 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,961 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,961 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][593], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:54,961 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:55:54,961 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,961 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:54,961 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:55,957 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][731], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:55,958 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:55:55,958 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:55,958 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:55,958 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:56,615 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][264], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 8#L51-1true, 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1648#(and (< l N) (<= l k)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:56,615 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:55:56,615 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:56,615 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:56,615 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:56,615 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:57,088 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][731], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l)]) [2021-03-26 05:55:57,088 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,089 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:57,089 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,089 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,092 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][264], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 100#(= min max), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:57,092 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,092 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,092 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,093 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:57,774 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][990], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:57,774 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,774 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,774 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,774 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,874 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][593], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:57,875 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:55:57,875 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,875 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,875 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:57,916 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][990], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), 833#true, Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:57,916 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:55:57,916 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:57,916 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:57,916 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:55:58,027 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][867], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:58,027 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,027 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:58,027 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:58,027 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,237 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][264], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:58,237 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,237 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:58,237 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,237 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,400 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][1086], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), 1397#(<= N l), Black: 207#(and (< j N) (<= j i)), 122#(<= min (select A 0))]) [2021-03-26 05:55:58,400 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,400 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:58,400 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:58,400 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:55:58,445 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][498], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:58,445 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,445 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,445 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,445 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,608 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][154], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 1473#(and (<= N l) (<= k (+ l 1))), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), 1488#(<= j l), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:58,608 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,608 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:58,608 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,608 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:58,608 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][867], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:58,608 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,608 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:58,608 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:58,609 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,692 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][60], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), 833#true, Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:58,692 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,692 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,692 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,692 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,878 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][498], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1648#(and (< l N) (<= l k)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:58,878 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,878 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,878 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,878 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,924 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][60], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:58,924 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,924 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,924 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,924 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:58,941 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][498], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, Black: 100#(= min max), 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:58,941 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,941 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:58,941 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:58,941 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:59,057 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][264], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:59,058 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:55:59,058 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:59,058 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:59,058 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:55:59,086 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][990], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), 1309#(<= (select A 0) (+ max 1)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, 1224#(<= (select A 0) max), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:59,086 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:55:59,086 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:59,087 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:59,087 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:59,495 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][498], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1392#true, 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:59,495 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:55:59,495 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:55:59,495 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:59,495 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:55:59,666 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][264], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-03-26 05:55:59,666 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 05:55:59,667 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:59,667 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:55:59,667 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:55:59,790 INFO L129 PetriNetUnfolder]: 36748/59916 cut-off events. [2021-03-26 05:55:59,790 INFO L130 PetriNetUnfolder]: For 2968151/3007396 co-relation queries the response was YES. [2021-03-26 05:56:00,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 700131 conditions, 59916 events. 36748/59916 cut-off events. For 2968151/3007396 co-relation queries the response was YES. Maximal size of possible extension queue 4425. Compared 545860 event pairs, 5676 based on Foata normal form. 2507/57329 useless extension candidates. Maximal degree in co-relation 693864. Up to 29887 conditions per place. [2021-03-26 05:56:01,681 INFO L142 LiptonReduction]: Number of co-enabled transitions 7940 [2021-03-26 05:56:02,009 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:56:02,009 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:56:02,009 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17985 [2021-03-26 05:56:02,010 INFO L480 AbstractCegarLoop]: Abstraction has has 189 places, 1151 transitions, 34383 flow [2021-03-26 05:56:02,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 0 states have call successors, (0), 0 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 05:56:02,010 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:56:02,010 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:56:02,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 05:56:02,212 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:56:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:56:02,212 INFO L82 PathProgramCache]: Analyzing trace with hash -980078005, now seen corresponding path program 5 times [2021-03-26 05:56:02,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:56:02,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805647889] [2021-03-26 05:56:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:56:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:56:02,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:56:02,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-03-26 05:56:02,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805647889] [2021-03-26 05:56:02,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052631995] [2021-03-26 05:56:02,243 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 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 05:56:02,282 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-03-26 05:56:02,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 05:56:02,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-26 05:56:02,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:56:02,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:56:02,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:56:02,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:56:02,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:56:02,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:56:02,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:56:02,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:56:02,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:56:02,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:56:02,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:56:02,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:56:02,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:56:02,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:56:02,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:56:02,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:56:02,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:56:02,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:56:02,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:56:02,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:56:02,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:56:02,333 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-26 05:56:02,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:56:02,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:56:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-03-26 05:56:02,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:56:02,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-03-26 05:56:02,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383312647] [2021-03-26 05:56:02,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 05:56:02,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:56:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 05:56:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 05:56:02,345 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 63 [2021-03-26 05:56:02,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1151 transitions, 34383 flow. Second operand has 7 states, 7 states have (on average 40.857142857142854) internal successors, (286), 7 states have internal predecessors, (286), 0 states have call successors, (0), 0 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 05:56:02,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:56:02,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 63 [2021-03-26 05:56:02,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 05:57:09,771 INFO L129 PetriNetUnfolder]: 118708/175555 cut-off events. [2021-03-26 05:57:09,772 INFO L130 PetriNetUnfolder]: For 8916422/8925902 co-relation queries the response was YES. [2021-03-26 05:57:12,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2172549 conditions, 175555 events. 118708/175555 cut-off events. For 8916422/8925902 co-relation queries the response was YES. Maximal size of possible extension queue 9491. Compared 1496116 event pairs, 15729 based on Foata normal form. 9551/183606 useless extension candidates. Maximal degree in co-relation 2161611. Up to 81322 conditions per place. [2021-03-26 05:57:13,984 INFO L132 encePairwiseOnDemand]: 58/63 looper letters, 1475 selfloop transitions, 773 changer transitions 1/2277 dead transitions. [2021-03-26 05:57:13,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 2277 transitions, 72213 flow [2021-03-26 05:57:13,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 05:57:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 05:57:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 320 transitions. [2021-03-26 05:57:13,987 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7256235827664399 [2021-03-26 05:57:13,987 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 320 transitions. [2021-03-26 05:57:13,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 320 transitions. [2021-03-26 05:57:13,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 05:57:13,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 320 transitions. [2021-03-26 05:57:13,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 0 states have call successors, (0), 0 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 05:57:13,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 63.0) internal successors, (504), 8 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 05:57:13,988 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 63.0) internal successors, (504), 8 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 05:57:13,988 INFO L185 Difference]: Start difference. First operand has 189 places, 1151 transitions, 34383 flow. Second operand 7 states and 320 transitions. [2021-03-26 05:57:13,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 2277 transitions, 72213 flow [2021-03-26 05:58:55,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 2277 transitions, 66341 flow, removed 2915 selfloop flow, removed 2 redundant places. [2021-03-26 05:58:55,570 INFO L241 Difference]: Finished difference. Result has 197 places, 1662 transitions, 52133 flow [2021-03-26 05:58:55,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=31832, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=389, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=52133, PETRI_PLACES=197, PETRI_TRANSITIONS=1662} [2021-03-26 05:58:55,572 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 160 predicate places. [2021-03-26 05:58:55,572 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 05:58:55,572 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 1662 transitions, 52133 flow [2021-03-26 05:58:55,572 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 1662 transitions, 52133 flow [2021-03-26 05:58:55,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 197 places, 1662 transitions, 52133 flow [2021-03-26 05:59:14,409 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][6], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1648#(and (< l N) (<= l k)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1392#true, 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:14,409 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 05:59:14,409 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:59:14,409 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:59:14,409 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:59:16,113 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1132], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:16,113 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:59:16,113 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:16,113 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:16,113 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:22,151 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 1473#(and (<= N l) (<= k (+ l 1))), Black: 60#(not b1), 833#true, Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:22,152 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:59:22,152 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:22,152 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:22,152 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:22,152 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1132], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 833#true, Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:22,152 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:59:22,152 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:22,152 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:22,152 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:22,152 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:22,213 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 833#true, 1473#(and (<= N l) (<= k (+ l 1))), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:22,213 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-03-26 05:59:22,213 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-26 05:59:22,213 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 05:59:22,213 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 05:59:22,213 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-26 05:59:23,056 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1431], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:23,057 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:59:23,057 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:23,057 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:23,057 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:25,668 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][36], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:25,668 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 05:59:25,668 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:25,668 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:25,668 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:27,031 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1132], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:27,032 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:27,032 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:27,032 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:27,032 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:27,912 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][352], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 38#thread4EXITtrue, 427#(<= N l), 44#L27-1true, Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1397#(<= N l), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), 122#(<= min (select A 0)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:27,912 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:59:27,912 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:59:27,912 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:59:27,912 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:27,913 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][352], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 326#(<= i k), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1397#(<= N l), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), 122#(<= min (select A 0)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:27,913 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:59:27,913 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:59:27,913 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:59:27,913 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 05:59:28,043 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1326], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:28,043 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:28,043 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:28,043 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:28,043 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:29,247 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), 1392#true, 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:29,247 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:59:29,247 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:29,247 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:29,247 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:29,608 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][919], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:29,608 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:29,608 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:29,608 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:29,608 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:29,862 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][701], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:29,862 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:59:29,862 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:29,862 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:29,862 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:30,499 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][6], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1392#true, 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:30,500 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:59:30,500 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:30,500 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:30,500 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:30,600 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][116], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:30,600 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 05:59:30,600 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:30,600 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:30,600 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:31,535 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][495], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1473#(and (<= N l) (<= k (+ l 1))), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:31,536 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:31,536 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:31,536 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:31,536 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:31,536 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1132], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:31,536 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:31,536 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:31,536 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:31,536 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:31,536 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:31,596 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][495], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 833#true, Black: 446#(<= (+ i 1) N), 1473#(and (<= N l) (<= k (+ l 1))), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:31,597 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-03-26 05:59:31,597 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 05:59:31,597 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 05:59:31,597 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 05:59:31,597 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 05:59:32,172 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][808], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 38#thread4EXITtrue, 427#(<= N l), 44#L27-1true, Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), 1473#(and (<= N l) (<= k (+ l 1))), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), 1488#(<= j l), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:32,173 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,173 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,173 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,173 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,173 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1326], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:32,173 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,173 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,173 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,173 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,173 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,761 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:32,761 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-03-26 05:59:32,761 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 05:59:32,761 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 05:59:32,761 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 05:59:32,826 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1404], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 1575#(<= l k), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:32,826 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,826 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:32,826 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,826 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:32,938 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1404], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:32,939 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:59:32,939 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,939 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:32,939 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:33,844 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][771], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:33,844 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:33,844 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:33,844 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:33,845 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:33,912 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][919], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:33,912 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:33,918 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1588], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 833#true, Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:33,918 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:33,918 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:33,918 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:33,918 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:34,033 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][116], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1392#true, 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:34,033 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:34,033 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:34,033 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:34,033 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:34,150 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][488], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:34,151 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:34,151 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:34,151 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:34,151 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 05:59:34,392 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][84], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1648#(and (< l N) (<= l k)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1392#true, 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:34,392 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 05:59:34,392 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:34,392 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:34,392 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:35,044 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][352], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 38#thread4EXITtrue, 427#(<= N l), 44#L27-1true, Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), 1397#(<= N l), Black: 207#(and (< j N) (<= j i)), 122#(<= min (select A 0)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:35,044 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:59:35,044 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:35,044 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:35,044 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:35,045 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][352], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), 1397#(<= N l), Black: 207#(and (< j N) (<= j i)), 122#(<= min (select A 0)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:35,045 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:59:35,045 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:35,045 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:35,045 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 05:59:35,071 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1120], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:35,071 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:59:35,071 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:35,071 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:35,071 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:35,924 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:35,924 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-03-26 05:59:35,924 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 05:59:35,924 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 05:59:35,924 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 05:59:35,971 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1564], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:35,971 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-03-26 05:59:35,971 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 05:59:35,971 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 05:59:35,971 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 05:59:36,423 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][771], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1401#(<= k l), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:36,423 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:59:36,423 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:36,423 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:36,423 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:36,464 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][919], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:36,464 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:59:36,464 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:36,464 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:36,464 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:36,547 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][84], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), 1392#true, 625#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:36,548 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 05:59:36,548 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:36,548 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:36,548 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,114 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][309], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, Black: 100#(= min max), 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,115 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,115 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,115 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,115 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,131 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1120], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 60#(not b1), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,131 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,131 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,131 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,131 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,131 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][1331], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1566#true, Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 38#thread4EXITtrue, 427#(<= N l), Black: 426#(= j l), 437#(<= N l), Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 1473#(and (<= N l) (<= k (+ l 1))), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), 1488#(<= j l), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,131 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,131 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,131 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,131 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,323 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,324 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,324 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:37,324 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,324 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,324 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,324 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 05:59:37,324 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:37,324 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:37,324 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,324 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,345 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,345 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,345 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,345 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:37,345 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:37,345 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,385 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 21#L40-1true, Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 460#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 100#(= min max), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,385 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-03-26 05:59:37,385 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 05:59:37,385 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 05:59:37,385 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 05:59:37,393 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][488], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 8#L51-1true, Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,393 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,393 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,393 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,393 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,416 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1564], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, 13#thread1EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1488#(<= j l), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 445#(= l i), Black: 446#(<= (+ i 1) N), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,416 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-03-26 05:59:37,416 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 05:59:37,416 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 05:59:37,416 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 05:59:37,481 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1588], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1566#true, Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), 1471#(and (<= N l) (<= k l)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:37,482 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:59:37,482 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 05:59:37,482 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:37,482 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:38,260 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][488], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), 1309#(<= (select A 0) (+ max 1)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), 833#true, Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, 1224#(<= (select A 0) max), Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), 625#true, Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:38,260 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 05:59:38,260 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:38,260 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:38,260 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:38,717 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:38,718 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 05:59:38,718 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:38,718 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:38,718 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:38,724 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][656], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:38,724 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 05:59:38,724 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:38,724 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:38,724 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:38,743 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1392#true, 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:38,743 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-03-26 05:59:38,743 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-03-26 05:59:38,743 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 05:59:38,744 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 05:59:38,751 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 664#(<= min max), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:38,751 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 05:59:38,751 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:38,751 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:38,751 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:38,751 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:38,751 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 05:59:39,279 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 326#(<= i k), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, 1648#(and (< l N) (<= l k)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:39,279 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-26 05:59:39,280 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,280 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:39,280 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:39,280 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,280 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:39,280 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,280 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,280 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,280 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:39,300 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), 21#L40-1true, Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 460#true, 76#true, Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:39,300 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,300 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,300 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,300 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:39,300 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:39,310 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 100#(= min max), 1648#(and (< l N) (<= l k)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:39,310 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,310 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 05:59:39,310 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,310 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,325 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][488], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 1575#(<= l k), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:39,325 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,325 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,325 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,325 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,687 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:39,688 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-26 05:59:39,688 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,688 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:39,688 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:39,694 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][656], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 389#(and (< i N) (<= i k)), Black: 120#(= i 0), Black: 326#(<= i k), Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1575#(<= l k), Black: 1224#(<= (select A 0) max), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 32#thread3EXITtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 34#L83true, Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, 44#L27-1true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 833#true, Black: 1135#(<= min (+ (select A 0) 1)), 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), 1648#(and (< l N) (<= l k)), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:39,694 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-26 05:59:39,694 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,694 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,694 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,710 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), Black: 60#(not b1), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), Black: 716#(and (= i 0) (= max (select A 0))), 1131#true, Black: 1308#(and (= k 0) (= max (select A k))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1648#(and (< l N) (<= l k)), Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), 1392#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:39,711 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-26 05:59:39,711 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,711 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:39,711 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:39,711 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-26 05:59:39,711 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 05:59:39,934 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][447], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 13#thread1EXITtrue, 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), 34#L83true, Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 1662#(and (<= (+ l 1) k) (< (+ l 1) N)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), 1648#(and (< l N) (<= l k)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l)]) [2021-03-26 05:59:39,934 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-26 05:59:39,934 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,934 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:39,934 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,943 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][374], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), 1043#true, Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 20#L85true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), 1305#true, Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 839#(<= min (select A 0)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1648#(and (< l N) (<= l k)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), 33#thread5ENTRYtrue, Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), 1700#true, Black: 546#(and (<= k i) (<= (+ k 1) N)), 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 1135#(<= min (+ (select A 0) 1)), Black: 60#(not b1), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 100#(= min max), Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l), 1662#(and (<= (+ l 1) k) (< (+ l 1) N))]) [2021-03-26 05:59:39,943 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-26 05:59:39,943 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 05:59:39,944 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:39,944 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:40,477 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][374], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 389#(and (< i N) (<= i k)), Black: 122#(<= min (select A 0)), Black: 326#(<= i k), Black: 191#(and (= i 0) (<= j i)), Black: 949#(and (= l 0) (= l k) (= i 0) (= j 0) (= max (select A k))), 14#L62-1true, Black: 951#(and (<= (select A l) (+ max 1)) (= l 0) (= i 0)), Black: 986#(and (= i 0) (<= (select A 0) max)), Black: 1664#(and (<= (+ i 1) N) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1666#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), 1043#true, 20#L85true, Black: 1571#(<= (+ i 1) N), Black: 1670#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), Black: 1224#(<= (select A 0) max), Black: 1575#(<= l k), Black: 1672#(and (<= (+ i 1) N) (< l N) (<= l k)), 664#(<= min max), Black: 1674#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= l k)), 1305#true, Black: 1676#(and (<= (+ i 1) N) (<= (+ l 1) k) (< l N)), Black: 915#(and (<= min max) (<= min (select A 0))), Black: 1488#(<= j l), Black: 1678#(and (<= (+ i 1) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1556#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 839#(<= min (select A 0)), Black: 1680#(and (<= (+ i 1) N) (<= l k)), Black: 1648#(and (< l N) (<= l k)), Black: 1558#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 1650#(and (<= (+ l 1) k) (< l N)), Black: 1560#(and (<= (+ j 1) N) (<= j l)), Black: 1652#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= (+ l 1) k) (< l N)), Black: 1654#(and (<= (+ i 2) N) (<= (+ i 1) k) (<= (+ l 1) k) (< (+ l 1) N)), 32#thread3EXITtrue, Black: 1656#(and (<= (+ i 1) N) (<= (+ i 1) k) (<= l k)), Black: 1658#(and (<= (+ i 2) N) (<= (+ i 1) k) (< l N) (<= l k)), Black: 1660#(and (<= (+ i 1) N) (<= (+ i 1) k)), Black: 546#(and (<= k i) (<= (+ k 1) N)), 1700#true, 424#true, Black: 426#(= j l), 433#true, Black: 435#(and (= k i) (= l i)), Black: 445#(= l i), Black: 1134#(and (= l 0) (= (select A l) min)), Black: 60#(not b1), Black: 1135#(<= min (+ (select A 0) 1)), Black: 446#(<= (+ i 1) N), 833#true, 1218#true, Black: 1395#(<= k (+ l 1)), Black: 1401#(<= k l), Black: 1469#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1471#(and (<= N l) (<= k l)), 1479#true, Black: 69#(not b2), 76#true, 463#(<= N j), Black: 462#(= j i), Black: 471#(<= (+ l 1) N), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), 97#true, Black: 660#(and (= i 0) (<= (select A 0) max)), Black: 710#(and (= l i) (= i 0) (<= (select A 0) max)), Black: 1047#(and (= k 0) (<= min (+ (select A k) 1))), Black: 1048#(<= min (select A 0)), Black: 714#(and v_assert (= min max)), 1131#true, Black: 716#(and (= i 0) (= max (select A 0))), Black: 702#(and (= l i) (= i 0) (= max (select A 0))), Black: 1308#(and (= k 0) (= max (select A k))), Black: 1309#(<= (select A 0) (+ max 1)), Black: 99#(= min (select A 0)), 1392#true, Black: 621#(and (<= k l) (<= (+ k 1) N)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 1780#(and (<= (+ i 1) l) (<= (+ i 1) N)), Black: 1782#(and (<= (+ i 1) l) (<= (+ i 2) N)), Black: 1784#(and (<= (+ i 1) N) (<= i l)), Black: 1709#(<= i l), 1662#(and (<= (+ l 1) k) (< (+ l 1) N))]) [2021-03-26 05:59:40,477 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 05:59:40,477 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-26 05:59:40,477 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-26 05:59:40,477 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 05:59:40,608 INFO L129 PetriNetUnfolder]: 77095/128670 cut-off events. [2021-03-26 05:59:40,608 INFO L130 PetriNetUnfolder]: For 6613750/6684989 co-relation queries the response was YES. [2021-03-26 05:59:42,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1503596 conditions, 128670 events. 77095/128670 cut-off events. For 6613750/6684989 co-relation queries the response was YES. Maximal size of possible extension queue 9134. Compared 1322010 event pairs, 14075 based on Foata normal form. 4498/124885 useless extension candidates. Maximal degree in co-relation 1490146. Up to 64021 conditions per place. [2021-03-26 05:59:45,132 INFO L142 LiptonReduction]: Number of co-enabled transitions 10486 [2021-03-26 05:59:48,142 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 05:59:48,142 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 05:59:48,142 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52570 [2021-03-26 05:59:48,143 INFO L480 AbstractCegarLoop]: Abstraction has has 197 places, 1662 transitions, 52133 flow [2021-03-26 05:59:48,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 40.857142857142854) internal successors, (286), 7 states have internal predecessors, (286), 0 states have call successors, (0), 0 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 05:59:48,143 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 05:59:48,143 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 05:59:48,355 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-03-26 05:59:48,356 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 05:59:48,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 05:59:48,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1376406855, now seen corresponding path program 3 times [2021-03-26 05:59:48,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 05:59:48,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286285946] [2021-03-26 05:59:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 05:59:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 05:59:48,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:59:48,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:59:48,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-03-26 05:59:48,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286285946] [2021-03-26 05:59:48,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386061419] [2021-03-26 05:59:48,381 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 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 05:59:48,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-26 05:59:48,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-26 05:59:48,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-26 05:59:48,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 05:59:48,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:59:48,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,411 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:59:48,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:59:48,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:59:48,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:59:48,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:59:48,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:59:48,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:59:48,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 05:59:48,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 05:59:48,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:59:48,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 05:59:48,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:59:48,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:59:48,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:59:48,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:59:48,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 05:59:48,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 05:59:48,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,455 INFO L142 QuantifierPusher]: treesize reduction 1, result has 87.5 percent of original size [2021-03-26 05:59:48,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:59:48,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 05:59:48,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 05:59:48,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 05:59:48,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 05:59:48,465 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-26 05:59:48,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 05:59:48,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 05:59:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-03-26 05:59:48,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 05:59:48,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-26 05:59:48,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575563804] [2021-03-26 05:59:48,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 05:59:48,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 05:59:48,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 05:59:48,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 05:59:48,484 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 63 [2021-03-26 05:59:48,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 1662 transitions, 52133 flow. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 05:59:48,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 05:59:48,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 63 [2021-03-26 05:59:48,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 06:02:50,198 INFO L129 PetriNetUnfolder]: 216457/322116 cut-off events. [2021-03-26 06:02:50,198 INFO L130 PetriNetUnfolder]: For 16080582/16099066 co-relation queries the response was YES. [2021-03-26 06:02:56,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3972036 conditions, 322116 events. 216457/322116 cut-off events. For 16080582/16099066 co-relation queries the response was YES. Maximal size of possible extension queue 17199. Compared 2962236 event pairs, 19538 based on Foata normal form. 12141/332774 useless extension candidates. Maximal degree in co-relation 3952869. Up to 146604 conditions per place. [2021-03-26 06:02:58,252 INFO L132 encePairwiseOnDemand]: 58/63 looper letters, 4872 selfloop transitions, 271 changer transitions 15/5186 dead transitions. [2021-03-26 06:02:58,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 5186 transitions, 177658 flow [2021-03-26 06:02:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 06:02:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 06:02:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 365 transitions. [2021-03-26 06:02:58,253 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7242063492063492 [2021-03-26 06:02:58,253 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 365 transitions. [2021-03-26 06:02:58,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 365 transitions. [2021-03-26 06:02:58,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 06:02:58,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 365 transitions. [2021-03-26 06:02:58,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 0 states have call successors, (0), 0 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 06:02:58,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 63.0) internal successors, (567), 9 states have internal predecessors, (567), 0 states have call successors, (0), 0 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 06:02:58,255 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 63.0) internal successors, (567), 9 states have internal predecessors, (567), 0 states have call successors, (0), 0 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 06:02:58,255 INFO L185 Difference]: Start difference. First operand has 197 places, 1662 transitions, 52133 flow. Second operand 8 states and 365 transitions. [2021-03-26 06:02:58,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 5186 transitions, 177658 flow Received shutdown request... [2021-03-26 06:07:32,629 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 06:07:32,629 WARN L545 AbstractCegarLoop]: Verification canceled [2021-03-26 06:07:32,631 WARN L224 ceAbstractionStarter]: Timeout [2021-03-26 06:07:32,632 INFO L202 PluginConnector]: Adding new model min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 06:07:32 BasicIcfg [2021-03-26 06:07:32,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 06:07:32,632 INFO L168 Benchmark]: Toolchain (without parser) took 768219.20 ms. Allocated memory was 255.9 MB in the beginning and 15.9 GB in the end (delta: 15.7 GB). Free memory was 236.5 MB in the beginning and 8.4 GB in the end (delta: -8.2 GB). Peak memory consumption was 9.7 GB. Max. memory is 16.0 GB. [2021-03-26 06:07:32,632 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.43 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.6 MB in the end (delta: 93.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 06:07:32,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.42 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 06:07:32,632 INFO L168 Benchmark]: Boogie Preprocessor took 19.75 ms. Allocated memory is still 255.9 MB. Free memory was 234.9 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 06:07:32,633 INFO L168 Benchmark]: RCFGBuilder took 235.61 ms. Allocated memory is still 255.9 MB. Free memory was 233.8 MB in the beginning and 235.1 MB in the end (delta: -1.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.0 GB. [2021-03-26 06:07:32,633 INFO L168 Benchmark]: TraceAbstraction took 767933.59 ms. Allocated memory was 255.9 MB in the beginning and 15.9 GB in the end (delta: 15.7 GB). Free memory was 235.1 MB in the beginning and 8.4 GB in the end (delta: -8.2 GB). Peak memory consumption was 9.7 GB. Max. memory is 16.0 GB. [2021-03-26 06:07:32,633 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.43 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.6 MB in the end (delta: 93.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 25.42 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 19.75 ms. Allocated memory is still 255.9 MB. Free memory was 234.9 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 235.61 ms. Allocated memory is still 255.9 MB. Free memory was 233.8 MB in the beginning and 235.1 MB in the end (delta: -1.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 767933.59 ms. Allocated memory was 255.9 MB in the beginning and 15.9 GB in the end (delta: 15.7 GB). Free memory was 235.1 MB in the beginning and 8.4 GB in the end (delta: -8.2 GB). Peak memory consumption was 9.7 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 361.5ms, 47 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 25 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 216 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 194, positive: 193, positive conditional: 193, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, positive: 185, positive conditional: 0, positive unconditional: 185, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 186, positive: 185, positive conditional: 0, positive unconditional: 185, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 186, positive: 185, positive conditional: 0, positive unconditional: 185, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 194, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 186, unknown conditional: 186, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5ms, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.1ms, 52 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.6ms, 54 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 181.0ms, 102 PlacesBefore, 85 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 824 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 49, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 49, positive unconditional: 11, 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: 60, positive: 60, positive conditional: 0, positive unconditional: 60, 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: 120, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 27, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 197.3ms, 74 PlacesBefore, 74 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 870 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 31, 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: 31, positive: 31, positive conditional: 0, positive unconditional: 31, 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: 37, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 189.1ms, 78 PlacesBefore, 76 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 215.7ms, 80 PlacesBefore, 80 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 232.3ms, 85 PlacesBefore, 85 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 1136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 11 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 48, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.5ms, 89 PlacesBefore, 88 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 48, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 121.1ms, 91 PlacesBefore, 91 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 48, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 185.8ms, 93 PlacesBefore, 93 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 1024 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 48, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 180.6ms, 96 PlacesBefore, 96 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 1074 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 48, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 405.6ms, 131 PlacesBefore, 127 PlacesAfterwards, 214 TransitionsBefore, 214 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 95 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, positive: 95, positive conditional: 95, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 83, positive: 83, positive conditional: 83, 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: 83, positive: 83, positive conditional: 0, positive unconditional: 83, 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: 95, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 83, unknown conditional: 83, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 106, Positive conditional cache size: 106, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 158.9ms, 136 PlacesBefore, 117 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 848 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 33 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, 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: 20, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 33, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 130.0ms, 124 PlacesBefore, 116 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 157.8ms, 125 PlacesBefore, 121 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 982 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 203.3ms, 130 PlacesBefore, 130 PlacesAfterwards, 144 TransitionsBefore, 144 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 203.5ms, 144 PlacesBefore, 136 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 248.0ms, 139 PlacesBefore, 134 PlacesAfterwards, 143 TransitionsBefore, 143 TransitionsAfterwards, 996 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 649.5ms, 141 PlacesBefore, 141 PlacesAfterwards, 241 TransitionsBefore, 241 TransitionsAfterwards, 2034 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3068.4ms, 150 PlacesBefore, 150 PlacesAfterwards, 332 TransitionsBefore, 332 TransitionsAfterwards, 2972 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17984.6ms, 189 PlacesBefore, 189 PlacesAfterwards, 1151 TransitionsBefore, 1151 TransitionsAfterwards, 7940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52570.4ms, 197 PlacesBefore, 197 PlacesAfterwards, 1662 TransitionsBefore, 1662 TransitionsAfterwards, 10486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 90). Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 16.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 767844.8ms, OverallIterations: 25, TraceHistogramMax: 2, EmptinessCheckTime: 0.0ms, AutomataDifference: 682412.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 462.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 242 SDtfs, 818 SDslu, 507 SDs, 0 SdLazy, 2438 SolverSat, 393 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1394.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 578 GetRequests, 337 SyntacticMatches, 13 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1674.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=52133occurred in iteration=24, InterpolantAutomatonStates: 230, 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: 155.0ms SsaConstructionTime, 406.7ms SatisfiabilityAnalysisTime, 2831.8ms InterpolantComputationTime, 937 NumberOfCodeBlocks, 933 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 896 ConstructedInterpolants, 0 QuantifiedInterpolants, 2942 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1628 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 89/143 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