/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 19:35:07,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 19:35:07,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 19:35:07,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 19:35:07,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 19:35:07,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 19:35:07,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 19:35:07,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 19:35:07,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 19:35:07,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 19:35:07,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 19:35:07,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 19:35:07,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 19:35:07,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 19:35:07,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 19:35:07,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 19:35:07,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 19:35:07,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 19:35:07,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 19:35:07,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 19:35:07,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 19:35:07,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 19:35:07,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 19:35:07,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 19:35:07,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 19:35:07,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 19:35:07,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 19:35:07,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 19:35:07,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 19:35:07,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 19:35:07,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 19:35:07,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 19:35:07,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 19:35:07,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 19:35:07,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 19:35:07,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 19:35:07,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 19:35:07,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 19:35:07,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 19:35:07,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 19:35:07,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 19:35:07,475 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-NoLbe.epf [2022-12-05 19:35:07,509 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 19:35:07,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 19:35:07,510 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 19:35:07,510 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 19:35:07,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 19:35:07,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 19:35:07,512 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 19:35:07,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 19:35:07,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 19:35:07,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 19:35:07,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 19:35:07,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 19:35:07,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 19:35:07,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 19:35:07,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 19:35:07,513 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 19:35:07,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 19:35:07,514 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 19:35:07,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 19:35:07,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 19:35:07,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 19:35:07,514 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 19:35:07,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 19:35:07,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:35:07,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 19:35:07,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 19:35:07,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 19:35:07,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 19:35:07,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 19:35:07,515 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 19:35:07,515 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 19:35:07,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-05 19:35:07,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 19:35:07,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 19:35:07,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 19:35:07,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 19:35:07,812 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 19:35:07,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-05 19:35:08,822 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 19:35:08,976 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 19:35:08,976 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-05 19:35:08,982 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fed9327d/ab3319d94dc449158feccf212806e0a5/FLAG216cd197f [2022-12-05 19:35:09,000 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fed9327d/ab3319d94dc449158feccf212806e0a5 [2022-12-05 19:35:09,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 19:35:09,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 19:35:09,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 19:35:09,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 19:35:09,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 19:35:09,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcc9092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09, skipping insertion in model container [2022-12-05 19:35:09,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 19:35:09,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 19:35:09,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:35:09,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:35:09,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:35:09,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:35:09,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:35:09,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:35:09,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:35:09,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:35:09,173 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-12-05 19:35:09,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:35:09,202 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 19:35:09,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:35:09,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:35:09,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:35:09,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:35:09,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:35:09,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:35:09,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:35:09,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:35:09,218 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-12-05 19:35:09,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:35:09,229 INFO L208 MainTranslator]: Completed translation [2022-12-05 19:35:09,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09 WrapperNode [2022-12-05 19:35:09,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 19:35:09,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 19:35:09,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 19:35:09,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 19:35:09,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,256 INFO L138 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2022-12-05 19:35:09,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 19:35:09,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 19:35:09,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 19:35:09,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 19:35:09,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,274 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 19:35:09,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 19:35:09,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 19:35:09,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 19:35:09,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (1/1) ... [2022-12-05 19:35:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:35:09,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:09,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 19:35:09,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 19:35:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 19:35:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 19:35:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 19:35:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 19:35:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 19:35:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 19:35:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 19:35:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-05 19:35:09,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-05 19:35:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 19:35:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 19:35:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 19:35:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 19:35:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 19:35:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 19:35:09,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 19:35:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 19:35:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 19:35:09,345 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 19:35:09,482 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 19:35:09,483 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 19:35:09,715 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 19:35:09,788 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 19:35:09,788 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-05 19:35:09,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:35:09 BoogieIcfgContainer [2022-12-05 19:35:09,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 19:35:09,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 19:35:09,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 19:35:09,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 19:35:09,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 07:35:09" (1/3) ... [2022-12-05 19:35:09,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b53919d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:35:09, skipping insertion in model container [2022-12-05 19:35:09,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:35:09" (2/3) ... [2022-12-05 19:35:09,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b53919d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:35:09, skipping insertion in model container [2022-12-05 19:35:09,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:35:09" (3/3) ... [2022-12-05 19:35:09,796 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-05 19:35:09,811 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 19:35:09,811 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 19:35:09,812 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 19:35:09,879 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-05 19:35:09,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 124 transitions, 280 flow [2022-12-05 19:35:10,000 INFO L130 PetriNetUnfolder]: 10/120 cut-off events. [2022-12-05 19:35:10,000 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 19:35:10,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 10/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-05 19:35:10,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 124 transitions, 280 flow [2022-12-05 19:35:10,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 108 transitions, 240 flow [2022-12-05 19:35:10,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 19:35:10,029 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@177c2a89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 19:35:10,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 19:35:10,087 INFO L130 PetriNetUnfolder]: 10/107 cut-off events. [2022-12-05 19:35:10,088 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 19:35:10,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:10,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:10,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1376738967, now seen corresponding path program 1 times [2022-12-05 19:35:10,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:10,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889245699] [2022-12-05 19:35:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:10,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:10,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:10,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889245699] [2022-12-05 19:35:10,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889245699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:35:10,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:35:10,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 19:35:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342011026] [2022-12-05 19:35:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:10,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 19:35:10,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:10,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 19:35:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 19:35:10,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 124 [2022-12-05 19:35:10,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:10,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:10,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 124 [2022-12-05 19:35:10,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:10,717 INFO L130 PetriNetUnfolder]: 23/169 cut-off events. [2022-12-05 19:35:10,717 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-05 19:35:10,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 169 events. 23/169 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 223 event pairs, 0 based on Foata normal form. 43/202 useless extension candidates. Maximal degree in co-relation 137. Up to 36 conditions per place. [2022-12-05 19:35:10,719 INFO L137 encePairwiseOnDemand]: 108/124 looper letters, 25 selfloop transitions, 3 changer transitions 8/115 dead transitions. [2022-12-05 19:35:10,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 347 flow [2022-12-05 19:35:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:35:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:35:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 708 transitions. [2022-12-05 19:35:10,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.815668202764977 [2022-12-05 19:35:10,731 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 240 flow. Second operand 7 states and 708 transitions. [2022-12-05 19:35:10,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 347 flow [2022-12-05 19:35:10,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 317 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-05 19:35:10,740 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 235 flow [2022-12-05 19:35:10,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2022-12-05 19:35:10,744 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2022-12-05 19:35:10,744 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 235 flow [2022-12-05 19:35:10,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:10,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:10,745 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:10,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 19:35:10,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:10,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1598701238, now seen corresponding path program 1 times [2022-12-05 19:35:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:10,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086975868] [2022-12-05 19:35:10,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:11,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:11,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086975868] [2022-12-05 19:35:11,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086975868] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:11,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850196109] [2022-12-05 19:35:11,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:11,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:11,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:11,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:35:11,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 19:35:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:11,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 19:35:11,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:35:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:11,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:35:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:11,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850196109] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:11,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:35:11,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 22 [2022-12-05 19:35:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188996165] [2022-12-05 19:35:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:11,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:35:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:35:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-12-05 19:35:11,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 124 [2022-12-05 19:35:11,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 235 flow. Second operand has 8 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:11,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:11,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 124 [2022-12-05 19:35:11,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:12,172 INFO L130 PetriNetUnfolder]: 274/757 cut-off events. [2022-12-05 19:35:12,172 INFO L131 PetriNetUnfolder]: For 167/184 co-relation queries the response was YES. [2022-12-05 19:35:12,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 757 events. 274/757 cut-off events. For 167/184 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3705 event pairs, 44 based on Foata normal form. 1/618 useless extension candidates. Maximal degree in co-relation 1455. Up to 180 conditions per place. [2022-12-05 19:35:12,178 INFO L137 encePairwiseOnDemand]: 112/124 looper letters, 75 selfloop transitions, 14 changer transitions 0/159 dead transitions. [2022-12-05 19:35:12,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 159 transitions, 592 flow [2022-12-05 19:35:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:35:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:35:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 937 transitions. [2022-12-05 19:35:12,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7556451612903226 [2022-12-05 19:35:12,180 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 235 flow. Second operand 10 states and 937 transitions. [2022-12-05 19:35:12,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 159 transitions, 592 flow [2022-12-05 19:35:12,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 159 transitions, 572 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-05 19:35:12,183 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 292 flow [2022-12-05 19:35:12,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=292, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2022-12-05 19:35:12,184 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places. [2022-12-05 19:35:12,184 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 292 flow [2022-12-05 19:35:12,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:12,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:12,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:12,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-05 19:35:12,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:12,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:12,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1337864408, now seen corresponding path program 2 times [2022-12-05 19:35:12,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:12,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005190865] [2022-12-05 19:35:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:12,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:12,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:12,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005190865] [2022-12-05 19:35:12,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005190865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:35:12,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:35:12,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 19:35:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235112172] [2022-12-05 19:35:12,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:12,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:35:12,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:12,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:35:12,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-05 19:35:12,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 124 [2022-12-05 19:35:12,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 292 flow. Second operand has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:12,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:12,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 124 [2022-12-05 19:35:12,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:13,186 INFO L130 PetriNetUnfolder]: 2093/3846 cut-off events. [2022-12-05 19:35:13,186 INFO L131 PetriNetUnfolder]: For 2457/2498 co-relation queries the response was YES. [2022-12-05 19:35:13,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9046 conditions, 3846 events. 2093/3846 cut-off events. For 2457/2498 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24391 event pairs, 1051 based on Foata normal form. 25/3165 useless extension candidates. Maximal degree in co-relation 2621. Up to 1263 conditions per place. [2022-12-05 19:35:13,239 INFO L137 encePairwiseOnDemand]: 111/124 looper letters, 99 selfloop transitions, 17 changer transitions 0/178 dead transitions. [2022-12-05 19:35:13,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 178 transitions, 763 flow [2022-12-05 19:35:13,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:35:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:35:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 876 transitions. [2022-12-05 19:35:13,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7064516129032258 [2022-12-05 19:35:13,243 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 292 flow. Second operand 10 states and 876 transitions. [2022-12-05 19:35:13,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 178 transitions, 763 flow [2022-12-05 19:35:13,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 178 transitions, 754 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 19:35:13,250 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 389 flow [2022-12-05 19:35:13,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=389, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2022-12-05 19:35:13,251 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2022-12-05 19:35:13,252 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 389 flow [2022-12-05 19:35:13,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:13,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:13,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:13,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 19:35:13,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash -936934436, now seen corresponding path program 1 times [2022-12-05 19:35:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:13,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955055620] [2022-12-05 19:35:13,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:13,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:13,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955055620] [2022-12-05 19:35:13,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955055620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:35:13,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:35:13,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 19:35:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12190891] [2022-12-05 19:35:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:13,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:35:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:35:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-05 19:35:13,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 124 [2022-12-05 19:35:13,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 389 flow. Second operand has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:13,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:13,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 124 [2022-12-05 19:35:13,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:14,053 INFO L130 PetriNetUnfolder]: 2251/4278 cut-off events. [2022-12-05 19:35:14,054 INFO L131 PetriNetUnfolder]: For 3820/3820 co-relation queries the response was YES. [2022-12-05 19:35:14,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11072 conditions, 4278 events. 2251/4278 cut-off events. For 3820/3820 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 29064 event pairs, 500 based on Foata normal form. 0/3621 useless extension candidates. Maximal degree in co-relation 6101. Up to 1265 conditions per place. [2022-12-05 19:35:14,087 INFO L137 encePairwiseOnDemand]: 112/124 looper letters, 108 selfloop transitions, 16 changer transitions 8/194 dead transitions. [2022-12-05 19:35:14,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 194 transitions, 979 flow [2022-12-05 19:35:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:35:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:35:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 877 transitions. [2022-12-05 19:35:14,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.707258064516129 [2022-12-05 19:35:14,089 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 389 flow. Second operand 10 states and 877 transitions. [2022-12-05 19:35:14,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 194 transitions, 979 flow [2022-12-05 19:35:14,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 194 transitions, 963 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-05 19:35:14,102 INFO L231 Difference]: Finished difference. Result has 130 places, 121 transitions, 455 flow [2022-12-05 19:35:14,103 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=455, PETRI_PLACES=130, PETRI_TRANSITIONS=121} [2022-12-05 19:35:14,104 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 19 predicate places. [2022-12-05 19:35:14,105 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 121 transitions, 455 flow [2022-12-05 19:35:14,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:14,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:14,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:14,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 19:35:14,106 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 245648150, now seen corresponding path program 2 times [2022-12-05 19:35:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:14,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981620249] [2022-12-05 19:35:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:14,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981620249] [2022-12-05 19:35:14,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981620249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:35:14,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:35:14,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 19:35:14,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274809023] [2022-12-05 19:35:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:14,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:35:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:35:14,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-05 19:35:14,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 124 [2022-12-05 19:35:14,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 121 transitions, 455 flow. Second operand has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:14,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:14,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 124 [2022-12-05 19:35:14,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:14,796 INFO L130 PetriNetUnfolder]: 2196/4140 cut-off events. [2022-12-05 19:35:14,796 INFO L131 PetriNetUnfolder]: For 5084/5143 co-relation queries the response was YES. [2022-12-05 19:35:14,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11504 conditions, 4140 events. 2196/4140 cut-off events. For 5084/5143 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 27284 event pairs, 928 based on Foata normal form. 12/3713 useless extension candidates. Maximal degree in co-relation 6611. Up to 1556 conditions per place. [2022-12-05 19:35:14,819 INFO L137 encePairwiseOnDemand]: 114/124 looper letters, 87 selfloop transitions, 13 changer transitions 10/172 dead transitions. [2022-12-05 19:35:14,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 172 transitions, 889 flow [2022-12-05 19:35:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:35:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:35:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 703 transitions. [2022-12-05 19:35:14,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7086693548387096 [2022-12-05 19:35:14,821 INFO L175 Difference]: Start difference. First operand has 130 places, 121 transitions, 455 flow. Second operand 8 states and 703 transitions. [2022-12-05 19:35:14,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 172 transitions, 889 flow [2022-12-05 19:35:14,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 172 transitions, 867 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-05 19:35:14,827 INFO L231 Difference]: Finished difference. Result has 132 places, 121 transitions, 460 flow [2022-12-05 19:35:14,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=460, PETRI_PLACES=132, PETRI_TRANSITIONS=121} [2022-12-05 19:35:14,828 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 21 predicate places. [2022-12-05 19:35:14,828 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 121 transitions, 460 flow [2022-12-05 19:35:14,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:14,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:14,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:14,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 19:35:14,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1097664210, now seen corresponding path program 3 times [2022-12-05 19:35:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:14,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909888043] [2022-12-05 19:35:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:15,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909888043] [2022-12-05 19:35:15,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909888043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:15,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031329263] [2022-12-05 19:35:15,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 19:35:15,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:15,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:15,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:35:15,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-05 19:35:15,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 19:35:15,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:35:15,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 19:35:15,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:35:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:15,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 19:35:15,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031329263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:35:15,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 19:35:15,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-12-05 19:35:15,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768480317] [2022-12-05 19:35:15,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:15,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:35:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:35:15,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-05 19:35:15,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 124 [2022-12-05 19:35:15,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 460 flow. Second operand has 8 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:15,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:15,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 124 [2022-12-05 19:35:15,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:15,586 INFO L130 PetriNetUnfolder]: 759/1605 cut-off events. [2022-12-05 19:35:15,586 INFO L131 PetriNetUnfolder]: For 2050/2085 co-relation queries the response was YES. [2022-12-05 19:35:15,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4660 conditions, 1605 events. 759/1605 cut-off events. For 2050/2085 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9230 event pairs, 125 based on Foata normal form. 15/1524 useless extension candidates. Maximal degree in co-relation 2890. Up to 696 conditions per place. [2022-12-05 19:35:15,596 INFO L137 encePairwiseOnDemand]: 112/124 looper letters, 52 selfloop transitions, 14 changer transitions 2/145 dead transitions. [2022-12-05 19:35:15,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 145 transitions, 689 flow [2022-12-05 19:35:15,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:35:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:35:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 905 transitions. [2022-12-05 19:35:15,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7298387096774194 [2022-12-05 19:35:15,598 INFO L175 Difference]: Start difference. First operand has 132 places, 121 transitions, 460 flow. Second operand 10 states and 905 transitions. [2022-12-05 19:35:15,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 145 transitions, 689 flow [2022-12-05 19:35:15,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 663 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-05 19:35:15,602 INFO L231 Difference]: Finished difference. Result has 138 places, 124 transitions, 498 flow [2022-12-05 19:35:15,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=498, PETRI_PLACES=138, PETRI_TRANSITIONS=124} [2022-12-05 19:35:15,602 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 27 predicate places. [2022-12-05 19:35:15,602 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 124 transitions, 498 flow [2022-12-05 19:35:15,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:15,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:15,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:15,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-05 19:35:15,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-05 19:35:15,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:15,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2078171802, now seen corresponding path program 4 times [2022-12-05 19:35:15,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:15,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952997801] [2022-12-05 19:35:15,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:15,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:15,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:15,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952997801] [2022-12-05 19:35:15,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952997801] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:15,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160946460] [2022-12-05 19:35:15,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 19:35:15,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:16,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:35:16,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-05 19:35:16,077 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 19:35:16,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:35:16,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 19:35:16,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:35:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:16,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:35:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:16,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160946460] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:16,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:35:16,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2022-12-05 19:35:16,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112802702] [2022-12-05 19:35:16,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:16,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:35:16,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:16,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:35:16,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-05 19:35:16,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 124 [2022-12-05 19:35:16,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 124 transitions, 498 flow. Second operand has 8 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:16,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:16,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 124 [2022-12-05 19:35:16,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:16,735 INFO L130 PetriNetUnfolder]: 798/1829 cut-off events. [2022-12-05 19:35:16,735 INFO L131 PetriNetUnfolder]: For 2694/2747 co-relation queries the response was YES. [2022-12-05 19:35:16,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 1829 events. 798/1829 cut-off events. For 2694/2747 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11439 event pairs, 103 based on Foata normal form. 32/1719 useless extension candidates. Maximal degree in co-relation 5085. Up to 487 conditions per place. [2022-12-05 19:35:16,746 INFO L137 encePairwiseOnDemand]: 114/124 looper letters, 70 selfloop transitions, 18 changer transitions 5/170 dead transitions. [2022-12-05 19:35:16,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 170 transitions, 888 flow [2022-12-05 19:35:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:35:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:35:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 924 transitions. [2022-12-05 19:35:16,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7451612903225806 [2022-12-05 19:35:16,748 INFO L175 Difference]: Start difference. First operand has 138 places, 124 transitions, 498 flow. Second operand 10 states and 924 transitions. [2022-12-05 19:35:16,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 170 transitions, 888 flow [2022-12-05 19:35:16,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 170 transitions, 860 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-05 19:35:16,753 INFO L231 Difference]: Finished difference. Result has 141 places, 127 transitions, 537 flow [2022-12-05 19:35:16,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=537, PETRI_PLACES=141, PETRI_TRANSITIONS=127} [2022-12-05 19:35:16,753 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 30 predicate places. [2022-12-05 19:35:16,753 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 127 transitions, 537 flow [2022-12-05 19:35:16,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:16,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:16,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:16,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-05 19:35:16,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:16,958 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:16,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:16,959 INFO L85 PathProgramCache]: Analyzing trace with hash -804080363, now seen corresponding path program 1 times [2022-12-05 19:35:16,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:16,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696016575] [2022-12-05 19:35:16,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:16,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:17,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:17,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696016575] [2022-12-05 19:35:17,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696016575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:17,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085470194] [2022-12-05 19:35:17,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:17,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:17,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:17,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:35:17,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-05 19:35:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:17,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-05 19:35:17,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:35:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:17,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:35:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:17,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085470194] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:35:17,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:35:17,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2022-12-05 19:35:17,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641685230] [2022-12-05 19:35:17,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:35:17,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 19:35:17,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:17,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 19:35:17,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-05 19:35:17,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 124 [2022-12-05 19:35:17,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 127 transitions, 537 flow. Second operand has 13 states, 13 states have (on average 81.38461538461539) internal successors, (1058), 13 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:17,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:17,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 124 [2022-12-05 19:35:17,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:19,535 INFO L130 PetriNetUnfolder]: 9567/18157 cut-off events. [2022-12-05 19:35:19,535 INFO L131 PetriNetUnfolder]: For 42876/42929 co-relation queries the response was YES. [2022-12-05 19:35:19,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57803 conditions, 18157 events. 9567/18157 cut-off events. For 42876/42929 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 160931 event pairs, 924 based on Foata normal form. 688/17693 useless extension candidates. Maximal degree in co-relation 30493. Up to 3480 conditions per place. [2022-12-05 19:35:19,647 INFO L137 encePairwiseOnDemand]: 108/124 looper letters, 357 selfloop transitions, 65 changer transitions 34/517 dead transitions. [2022-12-05 19:35:19,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 517 transitions, 3750 flow [2022-12-05 19:35:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-05 19:35:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-05 19:35:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2365 transitions. [2022-12-05 19:35:19,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7063918757467145 [2022-12-05 19:35:19,651 INFO L175 Difference]: Start difference. First operand has 141 places, 127 transitions, 537 flow. Second operand 27 states and 2365 transitions. [2022-12-05 19:35:19,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 517 transitions, 3750 flow [2022-12-05 19:35:19,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 517 transitions, 3474 flow, removed 63 selfloop flow, removed 9 redundant places. [2022-12-05 19:35:19,674 INFO L231 Difference]: Finished difference. Result has 178 places, 187 transitions, 1259 flow [2022-12-05 19:35:19,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1259, PETRI_PLACES=178, PETRI_TRANSITIONS=187} [2022-12-05 19:35:19,674 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 67 predicate places. [2022-12-05 19:35:19,674 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 187 transitions, 1259 flow [2022-12-05 19:35:19,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 81.38461538461539) internal successors, (1058), 13 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:19,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:19,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:19,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-05 19:35:19,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:19,880 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:19,880 INFO L85 PathProgramCache]: Analyzing trace with hash -884653016, now seen corresponding path program 1 times [2022-12-05 19:35:19,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:19,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351166110] [2022-12-05 19:35:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:19,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:35:20,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:20,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351166110] [2022-12-05 19:35:20,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351166110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:35:20,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:35:20,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 19:35:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777630301] [2022-12-05 19:35:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:20,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 19:35:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:20,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 19:35:20,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-05 19:35:20,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 124 [2022-12-05 19:35:20,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 187 transitions, 1259 flow. Second operand has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:20,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:20,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 124 [2022-12-05 19:35:20,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:22,201 INFO L130 PetriNetUnfolder]: 8796/16814 cut-off events. [2022-12-05 19:35:22,201 INFO L131 PetriNetUnfolder]: For 79342/79342 co-relation queries the response was YES. [2022-12-05 19:35:22,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67901 conditions, 16814 events. 8796/16814 cut-off events. For 79342/79342 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 148720 event pairs, 2799 based on Foata normal form. 215/16617 useless extension candidates. Maximal degree in co-relation 67690. Up to 7189 conditions per place. [2022-12-05 19:35:22,332 INFO L137 encePairwiseOnDemand]: 111/124 looper letters, 193 selfloop transitions, 31 changer transitions 1/287 dead transitions. [2022-12-05 19:35:22,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 287 transitions, 2557 flow [2022-12-05 19:35:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:35:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:35:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 872 transitions. [2022-12-05 19:35:22,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7032258064516129 [2022-12-05 19:35:22,334 INFO L175 Difference]: Start difference. First operand has 178 places, 187 transitions, 1259 flow. Second operand 10 states and 872 transitions. [2022-12-05 19:35:22,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 287 transitions, 2557 flow [2022-12-05 19:35:22,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 287 transitions, 2403 flow, removed 74 selfloop flow, removed 11 redundant places. [2022-12-05 19:35:22,499 INFO L231 Difference]: Finished difference. Result has 170 places, 196 transitions, 1342 flow [2022-12-05 19:35:22,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1342, PETRI_PLACES=170, PETRI_TRANSITIONS=196} [2022-12-05 19:35:22,500 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 59 predicate places. [2022-12-05 19:35:22,500 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 196 transitions, 1342 flow [2022-12-05 19:35:22,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:22,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:22,501 INFO L213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:22,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 19:35:22,501 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash -146952730, now seen corresponding path program 1 times [2022-12-05 19:35:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:22,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368510697] [2022-12-05 19:35:22,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:22,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:22,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368510697] [2022-12-05 19:35:22,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368510697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:22,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435646683] [2022-12-05 19:35:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:22,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:22,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:22,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:35:22,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-05 19:35:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:22,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 19:35:22,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:35:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:35:23,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 19:35:23,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435646683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:35:23,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 19:35:23,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-12-05 19:35:23,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200437986] [2022-12-05 19:35:23,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:23,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:35:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:35:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-05 19:35:23,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 124 [2022-12-05 19:35:23,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 196 transitions, 1342 flow. Second operand has 8 states, 8 states have (on average 88.375) internal successors, (707), 8 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:23,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:23,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 124 [2022-12-05 19:35:23,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:23,568 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][47], [32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), Black: 766#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), 2334#true, Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2274#(and (= ~i1~0 0) (= ~counter~0 0)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 2294#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0)), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 68#L98-4true, 8#L64true, Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), 83#L75true, Black: 2350#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 1100#true, 179#(<= 0 ~i1~0), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), 741#true, Black: 743#(= ~i1~0 0), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2353#true]) [2022-12-05 19:35:23,568 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-05 19:35:23,568 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-05 19:35:23,568 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-05 19:35:23,568 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-05 19:35:23,638 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][47], [Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), Black: 766#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), 2334#true, Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2274#(and (= ~i1~0 0) (= ~counter~0 0)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1100#true, Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 2294#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0)), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 68#L98-4true, Black: 179#(<= 0 ~i1~0), 8#L64true, Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), 83#L75true, 1487#(< ~i2~0 ~N2~0), Black: 2350#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 5#L52true, 741#true, Black: 743#(= ~i1~0 0), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2353#true]) [2022-12-05 19:35:23,638 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,638 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,638 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-05 19:35:23,639 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,640 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][47], [Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 766#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), 2334#true, Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2274#(and (= ~i1~0 0) (= ~counter~0 0)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 2294#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0)), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 68#L98-4true, 8#L64true, Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), 83#L75true, Black: 2350#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 1100#true, 179#(<= 0 ~i1~0), 741#true, Black: 743#(= ~i1~0 0), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2353#true, 55#L51-1true]) [2022-12-05 19:35:23,640 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,640 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-05 19:35:23,641 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,641 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,645 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][47], [Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 766#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), 2334#true, Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2274#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1100#true, 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 2294#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0)), Black: 1735#(= ~counter~0 0), 68#L98-4true, Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 8#L64true, Black: 179#(<= 0 ~i1~0), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), 83#L75true, 1487#(< ~i2~0 ~N2~0), Black: 2350#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 5#L52true, 741#true, Black: 743#(= ~i1~0 0), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2353#true]) [2022-12-05 19:35:23,645 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,645 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,645 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,645 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,646 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][47], [Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 766#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), 2334#true, Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2274#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 2294#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0)), Black: 1735#(= ~counter~0 0), 68#L98-4true, Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 8#L64true, Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), 83#L75true, Black: 2350#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 1100#true, 179#(<= 0 ~i1~0), 741#true, Black: 743#(= ~i1~0 0), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2353#true, 55#L51-1true]) [2022-12-05 19:35:23,646 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,646 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,646 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,646 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,649 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][47], [Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 766#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), 733#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0) (< ~i2~0 (+ ~i1~0 1))), 2334#true, Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2274#(and (= ~i1~0 0) (= ~counter~0 0)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1100#true, 1687#(and (<= ~i2~0 0) (< ~i2~0 ~N2~0) (< ~i2~0 (+ ~j1~0 1))), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 2294#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0)), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 68#L98-4true, Black: 179#(<= 0 ~i1~0), 8#L64true, Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), 83#L75true, 1850#(= ~counter~0 1), Black: 2350#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 5#L52true, Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 741#true, Black: 743#(= ~i1~0 0), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2353#true]) [2022-12-05 19:35:23,649 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,649 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,649 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:23,649 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:35:24,248 INFO L130 PetriNetUnfolder]: 3600/8074 cut-off events. [2022-12-05 19:35:24,249 INFO L131 PetriNetUnfolder]: For 46392/47279 co-relation queries the response was YES. [2022-12-05 19:35:24,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32623 conditions, 8074 events. 3600/8074 cut-off events. For 46392/47279 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 72060 event pairs, 1065 based on Foata normal form. 157/7681 useless extension candidates. Maximal degree in co-relation 25570. Up to 3756 conditions per place. [2022-12-05 19:35:24,305 INFO L137 encePairwiseOnDemand]: 114/124 looper letters, 123 selfloop transitions, 31 changer transitions 0/233 dead transitions. [2022-12-05 19:35:24,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 233 transitions, 1918 flow [2022-12-05 19:35:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:35:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:35:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 823 transitions. [2022-12-05 19:35:24,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7374551971326165 [2022-12-05 19:35:24,307 INFO L175 Difference]: Start difference. First operand has 170 places, 196 transitions, 1342 flow. Second operand 9 states and 823 transitions. [2022-12-05 19:35:24,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 233 transitions, 1918 flow [2022-12-05 19:35:24,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 233 transitions, 1858 flow, removed 1 selfloop flow, removed 7 redundant places. [2022-12-05 19:35:24,365 INFO L231 Difference]: Finished difference. Result has 174 places, 201 transitions, 1448 flow [2022-12-05 19:35:24,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1448, PETRI_PLACES=174, PETRI_TRANSITIONS=201} [2022-12-05 19:35:24,367 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 63 predicate places. [2022-12-05 19:35:24,367 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 201 transitions, 1448 flow [2022-12-05 19:35:24,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.375) internal successors, (707), 8 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:24,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:24,368 INFO L213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:24,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-05 19:35:24,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-05 19:35:24,574 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:24,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1582358452, now seen corresponding path program 2 times [2022-12-05 19:35:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:24,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701093993] [2022-12-05 19:35:24,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:24,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:35:24,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:24,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701093993] [2022-12-05 19:35:24,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701093993] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:24,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67521950] [2022-12-05 19:35:24,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:35:24,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:24,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:24,789 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:35:24,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-05 19:35:24,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:35:24,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:35:24,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 19:35:24,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:35:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:35:25,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:35:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:35:25,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67521950] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:25,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:35:25,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 8] total 21 [2022-12-05 19:35:25,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746898781] [2022-12-05 19:35:25,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:35:25,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:35:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:35:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-12-05 19:35:25,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 124 [2022-12-05 19:35:25,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 201 transitions, 1448 flow. Second operand has 8 states, 8 states have (on average 88.375) internal successors, (707), 8 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:25,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:25,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 124 [2022-12-05 19:35:25,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:26,251 INFO L130 PetriNetUnfolder]: 3118/6985 cut-off events. [2022-12-05 19:35:26,251 INFO L131 PetriNetUnfolder]: For 40077/40745 co-relation queries the response was YES. [2022-12-05 19:35:26,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28375 conditions, 6985 events. 3118/6985 cut-off events. For 40077/40745 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 60127 event pairs, 522 based on Foata normal form. 168/6749 useless extension candidates. Maximal degree in co-relation 28272. Up to 1808 conditions per place. [2022-12-05 19:35:26,307 INFO L137 encePairwiseOnDemand]: 114/124 looper letters, 147 selfloop transitions, 41 changer transitions 6/273 dead transitions. [2022-12-05 19:35:26,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 273 transitions, 2385 flow [2022-12-05 19:35:26,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:35:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:35:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 914 transitions. [2022-12-05 19:35:26,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7370967741935484 [2022-12-05 19:35:26,310 INFO L175 Difference]: Start difference. First operand has 174 places, 201 transitions, 1448 flow. Second operand 10 states and 914 transitions. [2022-12-05 19:35:26,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 273 transitions, 2385 flow [2022-12-05 19:35:26,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 273 transitions, 2337 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-05 19:35:26,434 INFO L231 Difference]: Finished difference. Result has 177 places, 205 transitions, 1567 flow [2022-12-05 19:35:26,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1567, PETRI_PLACES=177, PETRI_TRANSITIONS=205} [2022-12-05 19:35:26,435 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 66 predicate places. [2022-12-05 19:35:26,435 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 205 transitions, 1567 flow [2022-12-05 19:35:26,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.375) internal successors, (707), 8 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:26,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:26,436 INFO L213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:26,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 19:35:26,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:26,653 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash 272717501, now seen corresponding path program 1 times [2022-12-05 19:35:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:26,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310345442] [2022-12-05 19:35:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:26,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:35:26,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:26,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310345442] [2022-12-05 19:35:26,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310345442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:26,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5139542] [2022-12-05 19:35:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:26,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:26,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:26,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:35:26,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-05 19:35:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:26,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 19:35:26,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:35:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:27,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:35:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:35:27,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5139542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:35:27,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:35:27,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-12-05 19:35:27,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910827603] [2022-12-05 19:35:27,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:35:27,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 19:35:27,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:27,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 19:35:27,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-05 19:35:27,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 124 [2022-12-05 19:35:27,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 205 transitions, 1567 flow. Second operand has 15 states, 15 states have (on average 81.2) internal successors, (1218), 15 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:27,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:27,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 124 [2022-12-05 19:35:27,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:31,030 INFO L130 PetriNetUnfolder]: 15564/28334 cut-off events. [2022-12-05 19:35:31,030 INFO L131 PetriNetUnfolder]: For 199147/199225 co-relation queries the response was YES. [2022-12-05 19:35:31,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128205 conditions, 28334 events. 15564/28334 cut-off events. For 199147/199225 co-relation queries the response was YES. Maximal size of possible extension queue 1714. Compared 258474 event pairs, 1614 based on Foata normal form. 1400/29333 useless extension candidates. Maximal degree in co-relation 113175. Up to 4206 conditions per place. [2022-12-05 19:35:31,417 INFO L137 encePairwiseOnDemand]: 108/124 looper letters, 416 selfloop transitions, 299 changer transitions 25/801 dead transitions. [2022-12-05 19:35:31,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 801 transitions, 8235 flow [2022-12-05 19:35:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-05 19:35:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-05 19:35:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3398 transitions. [2022-12-05 19:35:31,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7026468155500414 [2022-12-05 19:35:31,421 INFO L175 Difference]: Start difference. First operand has 177 places, 205 transitions, 1567 flow. Second operand 39 states and 3398 transitions. [2022-12-05 19:35:31,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 801 transitions, 8235 flow [2022-12-05 19:35:31,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 801 transitions, 8040 flow, removed 57 selfloop flow, removed 6 redundant places. [2022-12-05 19:35:31,764 INFO L231 Difference]: Finished difference. Result has 223 places, 463 transitions, 4909 flow [2022-12-05 19:35:31,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=4909, PETRI_PLACES=223, PETRI_TRANSITIONS=463} [2022-12-05 19:35:31,766 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 112 predicate places. [2022-12-05 19:35:31,766 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 463 transitions, 4909 flow [2022-12-05 19:35:31,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 81.2) internal successors, (1218), 15 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:31,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:31,768 INFO L213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:31,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-05 19:35:31,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:31,973 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:31,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1650515370, now seen corresponding path program 1 times [2022-12-05 19:35:31,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:31,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719289931] [2022-12-05 19:35:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:35:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:32,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719289931] [2022-12-05 19:35:32,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719289931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:32,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345822971] [2022-12-05 19:35:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:32,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:32,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:32,178 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:35:32,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-05 19:35:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:32,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-05 19:35:32,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:35:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:35:32,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:35:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:35:32,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345822971] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:35:32,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:35:32,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-12-05 19:35:32,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387612185] [2022-12-05 19:35:32,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:35:32,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-05 19:35:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:32,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-05 19:35:32,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-12-05 19:35:32,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 124 [2022-12-05 19:35:32,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 463 transitions, 4909 flow. Second operand has 24 states, 24 states have (on average 80.95833333333333) internal successors, (1943), 24 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:32,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:32,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 124 [2022-12-05 19:35:32,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:35:44,727 INFO L130 PetriNetUnfolder]: 39763/77126 cut-off events. [2022-12-05 19:35:44,727 INFO L131 PetriNetUnfolder]: For 677459/677720 co-relation queries the response was YES. [2022-12-05 19:35:45,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376242 conditions, 77126 events. 39763/77126 cut-off events. For 677459/677720 co-relation queries the response was YES. Maximal size of possible extension queue 4635. Compared 864704 event pairs, 6873 based on Foata normal form. 1449/77133 useless extension candidates. Maximal degree in co-relation 375836. Up to 10704 conditions per place. [2022-12-05 19:35:45,676 INFO L137 encePairwiseOnDemand]: 111/124 looper letters, 1299 selfloop transitions, 615 changer transitions 154/2130 dead transitions. [2022-12-05 19:35:45,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 2130 transitions, 29147 flow [2022-12-05 19:35:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-05 19:35:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-05 19:35:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2458 transitions. [2022-12-05 19:35:45,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7079493087557603 [2022-12-05 19:35:45,679 INFO L175 Difference]: Start difference. First operand has 223 places, 463 transitions, 4909 flow. Second operand 28 states and 2458 transitions. [2022-12-05 19:35:45,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 2130 transitions, 29147 flow [2022-12-05 19:35:50,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 2130 transitions, 25290 flow, removed 1692 selfloop flow, removed 14 redundant places. [2022-12-05 19:35:50,696 INFO L231 Difference]: Finished difference. Result has 246 places, 1047 transitions, 12588 flow [2022-12-05 19:35:50,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=4077, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=12588, PETRI_PLACES=246, PETRI_TRANSITIONS=1047} [2022-12-05 19:35:50,697 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 135 predicate places. [2022-12-05 19:35:50,697 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 1047 transitions, 12588 flow [2022-12-05 19:35:50,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 80.95833333333333) internal successors, (1943), 24 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:50,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:35:50,698 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:35:50,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-05 19:35:50,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-05 19:35:50,903 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:35:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:35:50,903 INFO L85 PathProgramCache]: Analyzing trace with hash -741950518, now seen corresponding path program 2 times [2022-12-05 19:35:50,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:35:50,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576478563] [2022-12-05 19:35:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:35:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:35:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:35:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:35:51,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:35:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576478563] [2022-12-05 19:35:51,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576478563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:35:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402000735] [2022-12-05 19:35:51,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:35:51,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:35:51,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:35:51,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:35:51,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-05 19:35:51,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:35:51,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:35:51,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-05 19:35:51,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:35:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:35:51,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:35:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:35:51,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402000735] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:35:51,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:35:51,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 28 [2022-12-05 19:35:51,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147045961] [2022-12-05 19:35:51,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:35:51,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-05 19:35:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:35:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-05 19:35:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2022-12-05 19:35:51,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 124 [2022-12-05 19:35:51,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 1047 transitions, 12588 flow. Second operand has 28 states, 28 states have (on average 80.25) internal successors, (2247), 28 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:35:51,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:35:51,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 124 [2022-12-05 19:35:51,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:36:27,812 INFO L130 PetriNetUnfolder]: 82669/165362 cut-off events. [2022-12-05 19:36:27,812 INFO L131 PetriNetUnfolder]: For 1627419/1627620 co-relation queries the response was YES. [2022-12-05 19:36:29,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850524 conditions, 165362 events. 82669/165362 cut-off events. For 1627419/1627620 co-relation queries the response was YES. Maximal size of possible extension queue 10543. Compared 2101762 event pairs, 8563 based on Foata normal form. 3482/166899 useless extension candidates. Maximal degree in co-relation 842459. Up to 25859 conditions per place. [2022-12-05 19:36:30,020 INFO L137 encePairwiseOnDemand]: 111/124 looper letters, 2237 selfloop transitions, 600 changer transitions 22/2921 dead transitions. [2022-12-05 19:36:30,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 2921 transitions, 39973 flow [2022-12-05 19:36:30,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-05 19:36:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-05 19:36:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2929 transitions. [2022-12-05 19:36:30,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7157869012707723 [2022-12-05 19:36:30,024 INFO L175 Difference]: Start difference. First operand has 246 places, 1047 transitions, 12588 flow. Second operand 33 states and 2929 transitions. [2022-12-05 19:36:30,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 2921 transitions, 39973 flow [2022-12-05 19:37:02,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 2921 transitions, 39033 flow, removed 413 selfloop flow, removed 9 redundant places. [2022-12-05 19:37:02,311 INFO L231 Difference]: Finished difference. Result has 286 places, 1458 transitions, 20945 flow [2022-12-05 19:37:02,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=12331, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=20945, PETRI_PLACES=286, PETRI_TRANSITIONS=1458} [2022-12-05 19:37:02,312 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 175 predicate places. [2022-12-05 19:37:02,312 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 1458 transitions, 20945 flow [2022-12-05 19:37:02,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 80.25) internal successors, (2247), 28 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:02,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:37:02,313 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:37:02,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-05 19:37:02,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-05 19:37:02,518 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 19:37:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:37:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 819601618, now seen corresponding path program 3 times [2022-12-05 19:37:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:37:02,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657933039] [2022-12-05 19:37:02,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:37:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:37:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:37:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:02,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:37:02,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657933039] [2022-12-05 19:37:02,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657933039] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:37:02,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444866701] [2022-12-05 19:37:02,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 19:37:02,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:02,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:37:02,691 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:37:02,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-05 19:37:02,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 19:37:02,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:37:02,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 19:37:02,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:37:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-05 19:37:03,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:37:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-05 19:37:03,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444866701] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:37:03,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:37:03,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 22 [2022-12-05 19:37:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74542348] [2022-12-05 19:37:03,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:37:03,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:37:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:37:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:37:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-12-05 19:37:03,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 124 [2022-12-05 19:37:03,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 1458 transitions, 20945 flow. Second operand has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:03,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:37:03,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 124 [2022-12-05 19:37:03,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:37:06,869 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][364], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 3978#(<= ~M1~0 ~j1~0), 3055#(not (< ~i2~0 ~N2~0)), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 3447#(= ~counter~0 1), 179#(<= 0 ~i1~0), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), 8#L64true, Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), 4689#(<= 0 ~i1~0), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), 55#L51-1true, Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:06,870 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-05 19:37:06,870 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:37:06,870 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:37:06,870 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:37:06,935 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([375] L75-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< 0 v_~counter~0_78) 1 0) |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_77 1) v_~counter~0_78) (= v_~j2~0_24 (+ v_~j2~0_25 1)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|)) InVars {~counter~0=v_~counter~0_78, ~j2~0=v_~j2~0_25} OutVars{~counter~0=v_~counter~0_77, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_24, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1067], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1100#true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), 45#L44true, Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 1735#(= ~counter~0 0), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 1487#(< ~i2~0 ~N2~0), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 105#L79true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 179#(<= 0 ~i1~0), 8#L64true, Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 5#L52true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:06,935 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-05 19:37:06,935 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:37:06,935 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:37:06,936 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-05 19:37:07,878 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][355], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 3978#(<= ~M1~0 ~j1~0), 3055#(not (< ~i2~0 ~N2~0)), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 179#(<= 0 ~i1~0), 3454#(= ~counter~0 2), 33#L67true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 5394#(<= 0 ~i1~0), 4620#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1))), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), 4689#(<= 0 ~i1~0), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), 55#L51-1true, Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:07,878 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-12-05 19:37:07,878 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-05 19:37:07,878 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-05 19:37:07,878 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-05 19:37:08,116 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][364], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 67#L41true, Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 83#L75true, Black: 3978#(<= ~M1~0 ~j1~0), 3055#(not (< ~i2~0 ~N2~0)), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 179#(<= 0 ~i1~0), 3454#(= ~counter~0 2), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 4620#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1))), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), 8#L64true, Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), 4689#(<= 0 ~i1~0), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1)), 55#L51-1true]) [2022-12-05 19:37:08,116 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-05 19:37:08,117 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-05 19:37:08,117 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-05 19:37:08,117 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-05 19:37:08,134 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][355], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1100#true, Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), 1497#(or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 3978#(<= ~M1~0 ~j1~0), 83#L75true, 3055#(not (< ~i2~0 ~N2~0)), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 179#(<= 0 ~i1~0), 3454#(= ~counter~0 2), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 5394#(<= 0 ~i1~0), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 4630#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3295#(<= (+ ~i2~0 1) ~N2~0), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), 4689#(<= 0 ~i1~0), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1)), 55#L51-1true]) [2022-12-05 19:37:08,134 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-05 19:37:08,134 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-05 19:37:08,134 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-05 19:37:08,134 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-05 19:37:08,401 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][521], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 3978#(<= ~M1~0 ~j1~0), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 116#L40-1true, 3447#(= ~counter~0 1), 179#(<= 0 ~i1~0), 33#L67true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 5394#(<= 0 ~i1~0), Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 3969#true, 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:08,402 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is not cut-off event [2022-12-05 19:37:08,402 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-05 19:37:08,402 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-05 19:37:08,402 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-12-05 19:37:10,510 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][355], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 1100#true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 67#L41true, 1497#(or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0))), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 3055#(not (< ~i2~0 ~N2~0)), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), 3978#(<= ~M1~0 ~j1~0), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 3447#(= ~counter~0 1), 179#(<= 0 ~i1~0), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 5394#(<= 0 ~i1~0), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3295#(<= (+ ~i2~0 1) ~N2~0), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), 4689#(<= 0 ~i1~0), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), 55#L51-1true, Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:10,510 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-05 19:37:10,510 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-05 19:37:10,510 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-05 19:37:10,510 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-05 19:37:11,326 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][613], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 3978#(<= ~M1~0 ~j1~0), 3055#(not (< ~i2~0 ~N2~0)), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 3447#(= ~counter~0 1), 179#(<= 0 ~i1~0), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), 8#L64true, Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, 4429#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), 4689#(<= 0 ~i1~0), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), 55#L51-1true, Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:11,327 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is not cut-off event [2022-12-05 19:37:11,327 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-05 19:37:11,327 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-05 19:37:11,327 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-05 19:37:11,640 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][364], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 3055#(not (< ~i2~0 ~N2~0)), Black: 3978#(<= ~M1~0 ~j1~0), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 3447#(= ~counter~0 1), 179#(<= 0 ~i1~0), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), 8#L64true, Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, 4429#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), 4689#(<= 0 ~i1~0), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), 55#L51-1true, Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:11,641 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is not cut-off event [2022-12-05 19:37:11,641 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-05 19:37:11,641 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-05 19:37:11,641 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-05 19:37:12,135 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][355], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), 67#L41true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 3055#(not (< ~i2~0 ~N2~0)), Black: 3978#(<= ~M1~0 ~j1~0), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 179#(<= 0 ~i1~0), 3454#(= ~counter~0 2), 33#L67true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 5394#(<= 0 ~i1~0), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, 4429#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), 4689#(<= 0 ~i1~0), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), 55#L51-1true, Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:12,135 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-05 19:37:12,135 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-05 19:37:12,135 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-05 19:37:12,135 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-05 19:37:14,156 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][613], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 67#L41true, Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 3978#(<= ~M1~0 ~j1~0), 3055#(not (< ~i2~0 ~N2~0)), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 179#(<= 0 ~i1~0), 3454#(= ~counter~0 2), 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), 8#L64true, Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, 4429#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), 4689#(<= 0 ~i1~0), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), 55#L51-1true, Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:14,157 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-05 19:37:14,157 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-05 19:37:14,157 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-05 19:37:14,157 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-05 19:37:15,608 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][364], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 67#L41true, Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 83#L75true, 3055#(not (< ~i2~0 ~N2~0)), Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 179#(<= 0 ~i1~0), 3454#(= ~counter~0 2), 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), Black: 2670#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 68#L98-4true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), 8#L64true, Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, 4429#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), 4689#(<= 0 ~i1~0), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1)), 55#L51-1true]) [2022-12-05 19:37:15,608 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-12-05 19:37:15,608 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-05 19:37:15,608 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-05 19:37:15,608 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-05 19:37:15,709 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][455], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), 3332#(= ~counter~0 0), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 179#(<= 0 ~i1~0), 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 3286#true, Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:15,709 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-05 19:37:15,709 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-05 19:37:15,709 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-05 19:37:15,709 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-05 19:37:15,747 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][455], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), 3332#(= ~counter~0 0), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 3978#(<= ~M1~0 ~j1~0), 99#L99-2true, 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 4638#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 179#(<= 0 ~i1~0), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 4689#(<= 0 ~i1~0), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:15,747 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-05 19:37:15,747 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-05 19:37:15,747 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-05 19:37:15,747 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-05 19:37:16,651 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([375] L75-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< 0 v_~counter~0_78) 1 0) |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_77 1) v_~counter~0_78) (= v_~j2~0_24 (+ v_~j2~0_25 1)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|)) InVars {~counter~0=v_~counter~0_78, ~j2~0=v_~j2~0_25} OutVars{~counter~0=v_~counter~0_77, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_24, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1152], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 1100#true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), 5341#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 1487#(< ~i2~0 ~N2~0), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 105#L79true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 179#(<= 0 ~i1~0), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 5#L52true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:16,651 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-12-05 19:37:16,651 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-05 19:37:16,651 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-05 19:37:16,651 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-05 19:37:16,807 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([375] L75-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< 0 v_~counter~0_78) 1 0) |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_77 1) v_~counter~0_78) (= v_~j2~0_24 (+ v_~j2~0_25 1)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|)) InVars {~counter~0=v_~counter~0_78, ~j2~0=v_~j2~0_25} OutVars{~counter~0=v_~counter~0_77, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_24, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1152], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1100#true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 5341#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 3978#(<= ~M1~0 ~j1~0), 99#L99-2true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 4638#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 1487#(< ~i2~0 ~N2~0), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 105#L79true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 179#(<= 0 ~i1~0), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 5#L52true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:16,808 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-12-05 19:37:16,808 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-05 19:37:16,808 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-05 19:37:16,808 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-05 19:37:17,390 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][521], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 3447#(= ~counter~0 1), 179#(<= 0 ~i1~0), 33#L67true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 5394#(<= 0 ~i1~0), Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 3969#true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:17,390 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-12-05 19:37:17,390 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-12-05 19:37:17,390 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-12-05 19:37:17,391 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-12-05 19:37:17,968 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][654], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 3978#(<= ~M1~0 ~j1~0), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 179#(<= 0 ~i1~0), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 3286#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:17,968 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-05 19:37:17,968 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:17,968 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:17,968 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:18,213 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][712], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 83#L75true, Black: 3978#(<= ~M1~0 ~j1~0), 99#L99-2true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 179#(<= 0 ~i1~0), 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 3286#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:18,214 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-05 19:37:18,214 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:18,214 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:18,214 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:18,242 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][712], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 83#L75true, Black: 3978#(<= ~M1~0 ~j1~0), 99#L99-2true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 4638#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 179#(<= 0 ~i1~0), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 3286#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 4689#(<= 0 ~i1~0), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:18,243 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-05 19:37:18,243 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:18,243 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:18,243 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:19,058 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([375] L75-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< 0 v_~counter~0_78) 1 0) |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_77 1) v_~counter~0_78) (= v_~j2~0_24 (+ v_~j2~0_25 1)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|)) InVars {~counter~0=v_~counter~0_78, ~j2~0=v_~j2~0_25} OutVars{~counter~0=v_~counter~0_77, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_24, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1214], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1100#true, Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), 5341#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 1487#(< ~i2~0 ~N2~0), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 105#L79true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 179#(<= 0 ~i1~0), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 5#L52true, Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:19,059 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-12-05 19:37:19,059 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-12-05 19:37:19,059 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-12-05 19:37:19,059 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-12-05 19:37:19,289 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([375] L75-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< 0 v_~counter~0_78) 1 0) |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_77 1) v_~counter~0_78) (= v_~j2~0_24 (+ v_~j2~0_25 1)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|)) InVars {~counter~0=v_~counter~0_78, ~j2~0=v_~j2~0_25} OutVars{~counter~0=v_~counter~0_77, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_24, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1214], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1100#true, Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), 5341#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 4638#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 1487#(< ~i2~0 ~N2~0), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 105#L79true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 179#(<= 0 ~i1~0), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 5#L52true, Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:19,289 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-12-05 19:37:19,289 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-12-05 19:37:19,289 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-12-05 19:37:19,289 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-12-05 19:37:19,477 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][794], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 83#L75true, 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 179#(<= 0 ~i1~0), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 3286#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 3969#true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), 8#L64true, Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:19,477 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-05 19:37:19,477 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:19,477 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-05 19:37:19,477 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-05 19:37:20,644 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][455], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), 3332#(= ~counter~0 0), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, 83#L75true, Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 4638#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 179#(<= 0 ~i1~0), 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 4689#(<= 0 ~i1~0), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:20,645 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-05 19:37:20,645 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-05 19:37:20,645 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-05 19:37:20,645 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-05 19:37:20,645 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([375] L75-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< 0 v_~counter~0_78) 1 0) |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_77 1) v_~counter~0_78) (= v_~j2~0_24 (+ v_~j2~0_25 1)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|)) InVars {~counter~0=v_~counter~0_78, ~j2~0=v_~j2~0_25} OutVars{~counter~0=v_~counter~0_77, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_24, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1438], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 132#(= ~counter~0 0), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1100#true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 5341#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 4638#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 3969#true, Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 1487#(< ~i2~0 ~N2~0), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 40#L63-1true, 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 105#L79true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), 5988#(and (<= 0 ~i1~0) (or (< ~j1~0 ~M1~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 179#(<= 0 ~i1~0), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 4689#(<= 0 ~i1~0), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 5#L52true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:20,645 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-05 19:37:20,645 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-05 19:37:20,645 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-05 19:37:20,645 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-05 19:37:24,516 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][1203], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), 83#L75true, Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 179#(<= 0 ~i1~0), Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 3286#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 3969#true, 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), 8#L64true, Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:24,516 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-05 19:37:24,516 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-05 19:37:24,516 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-05 19:37:24,516 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-05 19:37:24,516 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([375] L75-->L79: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< 0 v_~counter~0_78) 1 0) |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_77 1) v_~counter~0_78) (= v_~j2~0_24 (+ v_~j2~0_25 1)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|)) InVars {~counter~0=v_~counter~0_78, ~j2~0=v_~j2~0_25} OutVars{~counter~0=v_~counter~0_77, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_24, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1213], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 1100#true, Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), 1487#(< ~i2~0 ~N2~0), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 105#L79true, 5331#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 3969#true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 179#(<= 0 ~i1~0), 8#L64true, Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 5#L52true, Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3286#true, Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:24,516 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-05 19:37:24,516 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-05 19:37:24,516 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-05 19:37:24,516 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-05 19:37:24,595 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (< 0 v_~counter~0_70) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (+ v_~counter~0_69 1) v_~counter~0_70) (= v_~i2~0_20 (+ v_~i2~0_21 1))) InVars {~counter~0=v_~counter~0_70, ~i2~0=v_~i2~0_21} OutVars{~counter~0=v_~counter~0_69, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_20} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][794], [Black: 3918#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 2)), 32#L56true, Black: 2296#(and (= ~i1~0 0) (= ~counter~0 1)), Black: 2282#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 1696#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 2284#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 0)), Black: 132#(= ~counter~0 0), 81#L74-1true, Black: 1850#(= ~counter~0 1), Black: 2292#(and (= ~i1~0 0) (= ~j2~0 0) (<= (+ ~i1~0 1) ~M2~0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 2286#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 1)), Black: 2290#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0) (= ~counter~0 1)), Black: 1698#(and (<= 1 ~M2~0) (= ~j2~0 0)), Black: 784#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 1685#(and (<= ~i2~0 0) (< ~i2~0 (+ ~j1~0 1)) (or (< ~i2~0 ~N2~0) (not (< ~j1~0 ~M1~0)))), Black: 1735#(= ~counter~0 0), 5315#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 2288#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~counter~0 0)), 2670#true, Black: 4616#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 ~j1~0)), Black: 4610#(and (<= ~M1~0 1) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4392#(< ~M1~0 (+ 2 ~j1~0)), Black: 4152#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4626#(and (= ~j1~0 0) (<= ~M1~0 ~j1~0)), 99#L99-2true, Black: 3978#(<= ~M1~0 ~j1~0), Black: 4612#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~j1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~M1~0 ~j1~0)), Black: 4624#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i1~0 1) (= ~M1~0 ~N1~0)), Black: 4608#(and (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 1)) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 4634#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 4628#(and (<= ~M1~0 1) (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (< ~i1~0 (+ ~j1~0 1)) (<= ~M1~0 ~j1~0)), Black: 4632#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~M1~0 ~j1~0)), 6000#(and (<= 0 ~i1~0) (< ~j1~0 ~M1~0)), Black: 2341#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), 179#(<= 0 ~i1~0), 1690#true, Black: 1092#(and (<= ~i2~0 0) (<= 0 ~j1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~M1~0 ~N2~0)), 3286#true, Black: 3080#(or (< ~i1~0 ~N1~0) (not (< ~i2~0 ~N2~0))), 3969#true, Black: 5327#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5301#(and (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5317#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5309#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), 8#L64true, Black: 5313#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 5307#(and (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 727#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0))) (< ~i2~0 (+ ~i1~0 1))), Black: 5319#(and (<= 0 ~i1~0) (< ~i2~0 ~N2~0)), Black: 5323#(and (<= 0 ~i1~0) (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5311#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5321#(and (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (< ~i2~0 ~N2~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5337#(and (<= 0 ~i1~0) (or (< ~i2~0 ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 5333#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0) (<= (+ ~N1~0 ~i2~0 1) (+ ~N2~0 ~i1~0))), Black: 4689#(<= 0 ~i1~0), Black: 2662#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= 0 ~i2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0) (<= ~i1~0 0)), Black: 5329#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (= ~M1~0 ~N1~0) (= ~M2~0 ~N1~0) (= ~N2~0 ~N1~0)), Black: 5303#(and (<= 2 ~N2~0) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 5305#(and (or (< (+ ~i2~0 1) ~N2~0) (not (< ~i1~0 ~N1~0))) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~M2~0 ~N1~0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 1100#true, Black: 3295#(<= (+ ~i2~0 1) ~N2~0), Black: 3934#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0))), Black: 3948#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 0)), Black: 747#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 3332#(= ~counter~0 0), Black: 3447#(= ~counter~0 1), Black: 3924#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 2)), Black: 3454#(= ~counter~0 2), Black: 3914#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 0)), Black: 3906#(and (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~N1~0 1) (+ ~N2~0 ~i1~0)) (= ~counter~0 1)), Black: 3916#(and (<= (+ ~i2~0 1) ~N2~0) (= ~counter~0 1))]) [2022-12-05 19:37:24,596 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-05 19:37:24,596 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-05 19:37:24,596 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-05 19:37:24,596 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event