./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec11f673f0852354e1b011c47ea1690182c02849435cfe6b9232c63dc6ffceb8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 13:48:52,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:48:52,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:48:52,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:48:52,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:48:52,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:48:52,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:48:52,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:48:52,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:48:52,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:48:52,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:48:52,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:48:52,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:48:52,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:48:52,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:48:52,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:48:52,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:48:52,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:48:52,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:48:52,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:48:52,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:48:52,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:48:52,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:48:52,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:48:52,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:48:52,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:48:52,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:48:52,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:48:52,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:48:52,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:48:52,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:48:52,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:48:52,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:48:52,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:48:52,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:48:52,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:48:52,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:48:52,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:48:52,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:48:52,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:48:52,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:48:52,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:48:52,614 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:48:52,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:48:52,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:48:52,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:48:52,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:48:52,616 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:48:52,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:48:52,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:48:52,616 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:48:52,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:48:52,617 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:48:52,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:48:52,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:48:52,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:48:52,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:48:52,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:48:52,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:48:52,618 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:48:52,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:48:52,618 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:48:52,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:48:52,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:48:52,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:48:52,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:48:52,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:48:52,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:48:52,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:48:52,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:48:52,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:48:52,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:48:52,620 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:48:52,620 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:48:52,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:48:52,620 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:48:52,620 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec11f673f0852354e1b011c47ea1690182c02849435cfe6b9232c63dc6ffceb8 [2021-12-22 13:48:52,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:48:52,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:48:52,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:48:52,835 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:48:52,836 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:48:52,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2021-12-22 13:48:52,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c123adb6/5243d340ee4242d3ae222980d2a39d6c/FLAG050bb994d [2021-12-22 13:48:53,211 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:48:53,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2021-12-22 13:48:53,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c123adb6/5243d340ee4242d3ae222980d2a39d6c/FLAG050bb994d [2021-12-22 13:48:53,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c123adb6/5243d340ee4242d3ae222980d2a39d6c [2021-12-22 13:48:53,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:48:53,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:48:53,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:48:53,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:48:53,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:48:53,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374cdfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53, skipping insertion in model container [2021-12-22 13:48:53,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:48:53,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:48:53,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2021-12-22 13:48:53,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:48:53,371 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:48:53,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2021-12-22 13:48:53,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:48:53,394 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:48:53,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53 WrapperNode [2021-12-22 13:48:53,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:48:53,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:48:53,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:48:53,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:48:53,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,420 INFO L137 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2021-12-22 13:48:53,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:48:53,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:48:53,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:48:53,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:48:53,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:48:53,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:48:53,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:48:53,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:48:53,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (1/1) ... [2021-12-22 13:48:53,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:48:53,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:48:53,471 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) [2021-12-22 13:48:53,477 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 [2021-12-22 13:48:53,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:48:53,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-22 13:48:53,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-22 13:48:53,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-22 13:48:53,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-22 13:48:53,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-22 13:48:53,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-22 13:48:53,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-22 13:48:53,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-22 13:48:53,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:48:53,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 13:48:53,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 13:48:53,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-22 13:48:53,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-22 13:48:53,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:48:53,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:48:53,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 13:48:53,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 13:48:53,516 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-22 13:48:53,578 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:48:53,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:48:53,753 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:48:53,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:48:53,808 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-22 13:48:53,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:48:53 BoogieIcfgContainer [2021-12-22 13:48:53,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:48:53,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:48:53,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:48:53,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:48:53,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:48:53" (1/3) ... [2021-12-22 13:48:53,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4730e433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:48:53, skipping insertion in model container [2021-12-22 13:48:53,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:48:53" (2/3) ... [2021-12-22 13:48:53,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4730e433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:48:53, skipping insertion in model container [2021-12-22 13:48:53,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:48:53" (3/3) ... [2021-12-22 13:48:53,825 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2021-12-22 13:48:53,828 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-22 13:48:53,828 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:48:53,828 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 13:48:53,828 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-22 13:48:53,877 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,878 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,878 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,878 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,878 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,879 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,882 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,887 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,887 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,887 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,887 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,887 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,888 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,888 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,888 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,888 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,888 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,889 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,889 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:48:53,906 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-22 13:48:53,939 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:48:53,944 INFO L339 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=true, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 13:48:53,944 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-22 13:48:53,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 131 transitions, 294 flow [2021-12-22 13:48:54,004 INFO L129 PetriNetUnfolder]: 10/127 cut-off events. [2021-12-22 13:48:54,005 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-22 13:48:54,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 127 events. 10/127 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2021-12-22 13:48:54,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 131 transitions, 294 flow [2021-12-22 13:48:54,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 114 transitions, 252 flow [2021-12-22 13:48:54,049 INFO L129 PetriNetUnfolder]: 10/113 cut-off events. [2021-12-22 13:48:54,050 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-22 13:48:54,050 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:48:54,050 INFO L254 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] [2021-12-22 13:48:54,051 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:48:54,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:48:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1069838279, now seen corresponding path program 1 times [2021-12-22 13:48:54,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:48:54,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084788305] [2021-12-22 13:48:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:48:54,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:48:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:48:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:54,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:48:54,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084788305] [2021-12-22 13:48:54,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084788305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:48:54,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:48:54,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 13:48:54,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930927607] [2021-12-22 13:48:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:48:54,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-22 13:48:54,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:48:54,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-22 13:48:54,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-22 13:48:54,341 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 131 [2021-12-22 13:48:54,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 252 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:48:54,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 131 [2021-12-22 13:48:54,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:48:54,376 INFO L129 PetriNetUnfolder]: 16/120 cut-off events. [2021-12-22 13:48:54,376 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-12-22 13:48:54,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 120 events. 16/120 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 18/132 useless extension candidates. Maximal degree in co-relation 98. Up to 25 conditions per place. [2021-12-22 13:48:54,378 INFO L132 encePairwiseOnDemand]: 125/131 looper letters, 12 selfloop transitions, 0 changer transitions 2/108 dead transitions. [2021-12-22 13:48:54,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 264 flow [2021-12-22 13:48:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 13:48:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-22 13:48:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2021-12-22 13:48:54,387 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2021-12-22 13:48:54,388 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 242 transitions. [2021-12-22 13:48:54,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 242 transitions. [2021-12-22 13:48:54,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:48:54,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 242 transitions. [2021-12-22 13:48:54,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 121.0) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,396 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,397 INFO L186 Difference]: Start difference. First operand has 117 places, 114 transitions, 252 flow. Second operand 2 states and 242 transitions. [2021-12-22 13:48:54,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 264 flow [2021-12-22 13:48:54,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 108 transitions, 248 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-22 13:48:54,403 INFO L242 Difference]: Finished difference. Result has 110 places, 106 transitions, 220 flow [2021-12-22 13:48:54,404 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=220, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2021-12-22 13:48:54,408 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -7 predicate places. [2021-12-22 13:48:54,409 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 220 flow [2021-12-22 13:48:54,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,409 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:48:54,410 INFO L254 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] [2021-12-22 13:48:54,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:48:54,411 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:48:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:48:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1574494246, now seen corresponding path program 1 times [2021-12-22 13:48:54,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:48:54,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293694964] [2021-12-22 13:48:54,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:48:54,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:48:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:48:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:54,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:48:54,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293694964] [2021-12-22 13:48:54,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293694964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:48:54,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:48:54,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 13:48:54,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82267992] [2021-12-22 13:48:54,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:48:54,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:48:54,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:48:54,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:48:54,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 13:48:54,555 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2021-12-22 13:48:54,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:48:54,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2021-12-22 13:48:54,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:48:54,630 INFO L129 PetriNetUnfolder]: 23/173 cut-off events. [2021-12-22 13:48:54,630 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-12-22 13:48:54,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 173 events. 23/173 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 225 event pairs, 0 based on Foata normal form. 9/174 useless extension candidates. Maximal degree in co-relation 231. Up to 36 conditions per place. [2021-12-22 13:48:54,632 INFO L132 encePairwiseOnDemand]: 123/131 looper letters, 25 selfloop transitions, 3 changer transitions 5/118 dead transitions. [2021-12-22 13:48:54,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 317 flow [2021-12-22 13:48:54,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 13:48:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-22 13:48:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2021-12-22 13:48:54,635 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8259541984732824 [2021-12-22 13:48:54,635 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2021-12-22 13:48:54,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2021-12-22 13:48:54,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:48:54,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2021-12-22 13:48:54,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,641 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,641 INFO L186 Difference]: Start difference. First operand has 110 places, 106 transitions, 220 flow. Second operand 5 states and 541 transitions. [2021-12-22 13:48:54,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 317 flow [2021-12-22 13:48:54,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 118 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-22 13:48:54,643 INFO L242 Difference]: Finished difference. Result has 115 places, 108 transitions, 247 flow [2021-12-22 13:48:54,644 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2021-12-22 13:48:54,644 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2021-12-22 13:48:54,644 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 247 flow [2021-12-22 13:48:54,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,645 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:48:54,645 INFO L254 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, 1, 1] [2021-12-22 13:48:54,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:48:54,646 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:48:54,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:48:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash -575216244, now seen corresponding path program 1 times [2021-12-22 13:48:54,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:48:54,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013063314] [2021-12-22 13:48:54,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:48:54,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:48:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:48:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:54,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:48:54,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013063314] [2021-12-22 13:48:54,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013063314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:48:54,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:48:54,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:48:54,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107797822] [2021-12-22 13:48:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:48:54,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:48:54,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:48:54,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:48:54,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:48:54,939 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-22 13:48:54,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 247 flow. Second operand has 9 states, 9 states have (on average 87.55555555555556) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:54,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:48:54,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-22 13:48:54,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:48:55,420 INFO L129 PetriNetUnfolder]: 2030/3464 cut-off events. [2021-12-22 13:48:55,420 INFO L130 PetriNetUnfolder]: For 591/703 co-relation queries the response was YES. [2021-12-22 13:48:55,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7351 conditions, 3464 events. 2030/3464 cut-off events. For 591/703 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20192 event pairs, 486 based on Foata normal form. 0/2481 useless extension candidates. Maximal degree in co-relation 7344. Up to 782 conditions per place. [2021-12-22 13:48:55,446 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 107 selfloop transitions, 12 changer transitions 0/187 dead transitions. [2021-12-22 13:48:55,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 187 transitions, 714 flow [2021-12-22 13:48:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:48:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:48:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 874 transitions. [2021-12-22 13:48:55,449 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741306191687871 [2021-12-22 13:48:55,449 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 874 transitions. [2021-12-22 13:48:55,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 874 transitions. [2021-12-22 13:48:55,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:48:55,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 874 transitions. [2021-12-22 13:48:55,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.11111111111111) internal successors, (874), 9 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:55,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:55,488 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:55,488 INFO L186 Difference]: Start difference. First operand has 115 places, 108 transitions, 247 flow. Second operand 9 states and 874 transitions. [2021-12-22 13:48:55,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 187 transitions, 714 flow [2021-12-22 13:48:55,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 187 transitions, 694 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-12-22 13:48:55,493 INFO L242 Difference]: Finished difference. Result has 122 places, 114 transitions, 315 flow [2021-12-22 13:48:55,493 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=315, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2021-12-22 13:48:55,494 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2021-12-22 13:48:55,494 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 315 flow [2021-12-22 13:48:55,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.55555555555556) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:55,495 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:48:55,495 INFO L254 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, 1, 1] [2021-12-22 13:48:55,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:48:55,495 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:48:55,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:48:55,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1075191398, now seen corresponding path program 2 times [2021-12-22 13:48:55,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:48:55,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873456574] [2021-12-22 13:48:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:48:55,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:48:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:48:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:55,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:48:55,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873456574] [2021-12-22 13:48:55,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873456574] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:48:55,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541871073] [2021-12-22 13:48:55,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 13:48:55,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:48:55,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:48:55,654 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) [2021-12-22 13:48:55,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 13:48:55,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 13:48:55,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 13:48:55,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 13:48:55,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:48:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:56,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:48:56,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541871073] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:48:56,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:48:56,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2021-12-22 13:48:56,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875231593] [2021-12-22 13:48:56,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:48:56,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:48:56,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:48:56,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:48:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-12-22 13:48:56,222 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2021-12-22 13:48:56,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 315 flow. Second operand has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:56,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:48:56,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2021-12-22 13:48:56,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:48:56,455 INFO L129 PetriNetUnfolder]: 319/720 cut-off events. [2021-12-22 13:48:56,456 INFO L130 PetriNetUnfolder]: For 450/462 co-relation queries the response was YES. [2021-12-22 13:48:56,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 720 events. 319/720 cut-off events. For 450/462 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3038 event pairs, 66 based on Foata normal form. 5/644 useless extension candidates. Maximal degree in co-relation 1777. Up to 233 conditions per place. [2021-12-22 13:48:56,462 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 50 selfloop transitions, 12 changer transitions 0/138 dead transitions. [2021-12-22 13:48:56,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 138 transitions, 522 flow [2021-12-22 13:48:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:48:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:48:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 975 transitions. [2021-12-22 13:48:56,464 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7442748091603053 [2021-12-22 13:48:56,464 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 975 transitions. [2021-12-22 13:48:56,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 975 transitions. [2021-12-22 13:48:56,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:48:56,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 975 transitions. [2021-12-22 13:48:56,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.5) internal successors, (975), 10 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:56,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:56,469 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:56,469 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 315 flow. Second operand 10 states and 975 transitions. [2021-12-22 13:48:56,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 138 transitions, 522 flow [2021-12-22 13:48:56,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 513 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-22 13:48:56,473 INFO L242 Difference]: Finished difference. Result has 130 places, 117 transitions, 357 flow [2021-12-22 13:48:56,473 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=357, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2021-12-22 13:48:56,474 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 13 predicate places. [2021-12-22 13:48:56,474 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 357 flow [2021-12-22 13:48:56,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:56,474 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:48:56,475 INFO L254 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, 1, 1] [2021-12-22 13:48:56,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 13:48:56,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:48:56,691 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:48:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:48:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash -956916982, now seen corresponding path program 1 times [2021-12-22 13:48:56,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:48:56,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879848251] [2021-12-22 13:48:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:48:56,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:48:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:48:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:56,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:48:56,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879848251] [2021-12-22 13:48:56,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879848251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:48:56,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:48:56,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:48:56,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160096918] [2021-12-22 13:48:56,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:48:56,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:48:56,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:48:56,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:48:56,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:48:56,866 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-22 13:48:56,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 357 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:56,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:48:56,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-22 13:48:56,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:48:57,320 INFO L129 PetriNetUnfolder]: 1977/3728 cut-off events. [2021-12-22 13:48:57,320 INFO L130 PetriNetUnfolder]: For 3939/4031 co-relation queries the response was YES. [2021-12-22 13:48:57,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 3728 events. 1977/3728 cut-off events. For 3939/4031 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24754 event pairs, 649 based on Foata normal form. 2/3138 useless extension candidates. Maximal degree in co-relation 9508. Up to 1083 conditions per place. [2021-12-22 13:48:57,346 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 98 selfloop transitions, 15 changer transitions 6/187 dead transitions. [2021-12-22 13:48:57,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 187 transitions, 870 flow [2021-12-22 13:48:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:48:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:48:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2021-12-22 13:48:57,348 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7229007633587786 [2021-12-22 13:48:57,349 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 947 transitions. [2021-12-22 13:48:57,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 947 transitions. [2021-12-22 13:48:57,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:48:57,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 947 transitions. [2021-12-22 13:48:57,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:57,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:57,356 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:57,356 INFO L186 Difference]: Start difference. First operand has 130 places, 117 transitions, 357 flow. Second operand 10 states and 947 transitions. [2021-12-22 13:48:57,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 187 transitions, 870 flow [2021-12-22 13:48:57,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 187 transitions, 854 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-22 13:48:57,365 INFO L242 Difference]: Finished difference. Result has 135 places, 121 transitions, 403 flow [2021-12-22 13:48:57,366 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=403, PETRI_PLACES=135, PETRI_TRANSITIONS=121} [2021-12-22 13:48:57,366 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2021-12-22 13:48:57,366 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 121 transitions, 403 flow [2021-12-22 13:48:57,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:57,367 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:48:57,367 INFO L254 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, 1, 1] [2021-12-22 13:48:57,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:48:57,367 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:48:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:48:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash 158599598, now seen corresponding path program 2 times [2021-12-22 13:48:57,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:48:57,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163402938] [2021-12-22 13:48:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:48:57,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:48:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:48:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:57,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:48:57,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163402938] [2021-12-22 13:48:57,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163402938] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:48:57,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:48:57,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:48:57,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418523437] [2021-12-22 13:48:57,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:48:57,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:48:57,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:48:57,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:48:57,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:48:57,569 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-22 13:48:57,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 121 transitions, 403 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:57,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:48:57,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-22 13:48:57,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:48:58,097 INFO L129 PetriNetUnfolder]: 2339/4309 cut-off events. [2021-12-22 13:48:58,097 INFO L130 PetriNetUnfolder]: For 5757/5798 co-relation queries the response was YES. [2021-12-22 13:48:58,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11975 conditions, 4309 events. 2339/4309 cut-off events. For 5757/5798 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28423 event pairs, 551 based on Foata normal form. 5/3832 useless extension candidates. Maximal degree in co-relation 11961. Up to 1307 conditions per place. [2021-12-22 13:48:58,125 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 102 selfloop transitions, 19 changer transitions 6/195 dead transitions. [2021-12-22 13:48:58,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 195 transitions, 980 flow [2021-12-22 13:48:58,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:48:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:48:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2021-12-22 13:48:58,128 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7251908396946565 [2021-12-22 13:48:58,128 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 950 transitions. [2021-12-22 13:48:58,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 950 transitions. [2021-12-22 13:48:58,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:48:58,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 950 transitions. [2021-12-22 13:48:58,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,132 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,132 INFO L186 Difference]: Start difference. First operand has 135 places, 121 transitions, 403 flow. Second operand 10 states and 950 transitions. [2021-12-22 13:48:58,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 195 transitions, 980 flow [2021-12-22 13:48:58,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 195 transitions, 959 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-22 13:48:58,139 INFO L242 Difference]: Finished difference. Result has 140 places, 128 transitions, 490 flow [2021-12-22 13:48:58,140 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=490, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2021-12-22 13:48:58,140 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2021-12-22 13:48:58,140 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 490 flow [2021-12-22 13:48:58,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,141 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:48:58,141 INFO L254 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, 1, 1] [2021-12-22 13:48:58,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:48:58,141 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:48:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:48:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1067075906, now seen corresponding path program 3 times [2021-12-22 13:48:58,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:48:58,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807537223] [2021-12-22 13:48:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:48:58,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:48:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:48:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:58,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:48:58,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807537223] [2021-12-22 13:48:58,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807537223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:48:58,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:48:58,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:48:58,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197095670] [2021-12-22 13:48:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:48:58,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:48:58,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:48:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:48:58,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:48:58,249 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-22 13:48:58,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 490 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:48:58,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-22 13:48:58,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:48:58,786 INFO L129 PetriNetUnfolder]: 2280/4136 cut-off events. [2021-12-22 13:48:58,786 INFO L130 PetriNetUnfolder]: For 7452/7576 co-relation queries the response was YES. [2021-12-22 13:48:58,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12574 conditions, 4136 events. 2280/4136 cut-off events. For 7452/7576 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 26533 event pairs, 1099 based on Foata normal form. 14/3705 useless extension candidates. Maximal degree in co-relation 12558. Up to 1831 conditions per place. [2021-12-22 13:48:58,814 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 83 selfloop transitions, 14 changer transitions 10/175 dead transitions. [2021-12-22 13:48:58,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 913 flow [2021-12-22 13:48:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 13:48:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-22 13:48:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 759 transitions. [2021-12-22 13:48:58,816 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7242366412213741 [2021-12-22 13:48:58,816 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 759 transitions. [2021-12-22 13:48:58,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 759 transitions. [2021-12-22 13:48:58,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:48:58,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 759 transitions. [2021-12-22 13:48:58,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,820 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,820 INFO L186 Difference]: Start difference. First operand has 140 places, 128 transitions, 490 flow. Second operand 8 states and 759 transitions. [2021-12-22 13:48:58,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 175 transitions, 913 flow [2021-12-22 13:48:58,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 175 transitions, 899 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-22 13:48:58,828 INFO L242 Difference]: Finished difference. Result has 143 places, 128 transitions, 508 flow [2021-12-22 13:48:58,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=508, PETRI_PLACES=143, PETRI_TRANSITIONS=128} [2021-12-22 13:48:58,829 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2021-12-22 13:48:58,829 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 128 transitions, 508 flow [2021-12-22 13:48:58,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,830 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:48:58,830 INFO L254 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, 1, 1] [2021-12-22 13:48:58,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:48:58,830 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:48:58,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:48:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash 616937690, now seen corresponding path program 4 times [2021-12-22 13:48:58,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:48:58,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303791893] [2021-12-22 13:48:58,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:48:58,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:48:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:48:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:58,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:48:58,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303791893] [2021-12-22 13:48:58,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303791893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:48:58,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:48:58,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:48:58,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700520596] [2021-12-22 13:48:58,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:48:58,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:48:58,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:48:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:48:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:48:58,932 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-22 13:48:58,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 128 transitions, 508 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:58,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:48:58,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-22 13:48:58,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:48:59,660 INFO L129 PetriNetUnfolder]: 3385/6203 cut-off events. [2021-12-22 13:48:59,661 INFO L130 PetriNetUnfolder]: For 13151/13207 co-relation queries the response was YES. [2021-12-22 13:48:59,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19013 conditions, 6203 events. 3385/6203 cut-off events. For 13151/13207 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 43759 event pairs, 917 based on Foata normal form. 25/5649 useless extension candidates. Maximal degree in co-relation 18996. Up to 2198 conditions per place. [2021-12-22 13:48:59,702 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 118 selfloop transitions, 26 changer transitions 1/213 dead transitions. [2021-12-22 13:48:59,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 213 transitions, 1284 flow [2021-12-22 13:48:59,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:48:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:48:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 945 transitions. [2021-12-22 13:48:59,705 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7213740458015268 [2021-12-22 13:48:59,705 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 945 transitions. [2021-12-22 13:48:59,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 945 transitions. [2021-12-22 13:48:59,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:48:59,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 945 transitions. [2021-12-22 13:48:59,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.5) internal successors, (945), 10 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:59,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:59,709 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:59,710 INFO L186 Difference]: Start difference. First operand has 143 places, 128 transitions, 508 flow. Second operand 10 states and 945 transitions. [2021-12-22 13:48:59,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 213 transitions, 1284 flow [2021-12-22 13:48:59,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 213 transitions, 1253 flow, removed 4 selfloop flow, removed 6 redundant places. [2021-12-22 13:48:59,719 INFO L242 Difference]: Finished difference. Result has 149 places, 143 transitions, 684 flow [2021-12-22 13:48:59,719 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=684, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2021-12-22 13:48:59,720 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2021-12-22 13:48:59,720 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 684 flow [2021-12-22 13:48:59,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:59,721 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:48:59,721 INFO L254 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, 1, 1] [2021-12-22 13:48:59,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:48:59,721 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:48:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:48:59,722 INFO L85 PathProgramCache]: Analyzing trace with hash 721298320, now seen corresponding path program 5 times [2021-12-22 13:48:59,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:48:59,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858027022] [2021-12-22 13:48:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:48:59,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:48:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:48:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:48:59,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:48:59,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858027022] [2021-12-22 13:48:59,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858027022] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:48:59,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897209279] [2021-12-22 13:48:59,829 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-22 13:48:59,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:48:59,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:48:59,830 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) [2021-12-22 13:48:59,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 13:48:59,923 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 13:48:59,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 13:48:59,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 13:48:59,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:49:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:00,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:49:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:00,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897209279] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-22 13:49:00,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-22 13:49:00,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2021-12-22 13:49:00,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223333845] [2021-12-22 13:49:00,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:49:00,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:49:00,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:49:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:49:00,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2021-12-22 13:49:00,486 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2021-12-22 13:49:00,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 684 flow. Second operand has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:00,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:49:00,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2021-12-22 13:49:00,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:49:00,884 INFO L129 PetriNetUnfolder]: 1279/3099 cut-off events. [2021-12-22 13:49:00,885 INFO L130 PetriNetUnfolder]: For 7636/8046 co-relation queries the response was YES. [2021-12-22 13:49:00,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10184 conditions, 3099 events. 1279/3099 cut-off events. For 7636/8046 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23008 event pairs, 218 based on Foata normal form. 68/2986 useless extension candidates. Maximal degree in co-relation 10165. Up to 966 conditions per place. [2021-12-22 13:49:00,911 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 92 selfloop transitions, 21 changer transitions 7/200 dead transitions. [2021-12-22 13:49:00,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 200 transitions, 1305 flow [2021-12-22 13:49:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:49:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:49:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 993 transitions. [2021-12-22 13:49:00,913 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7580152671755725 [2021-12-22 13:49:00,913 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 993 transitions. [2021-12-22 13:49:00,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 993 transitions. [2021-12-22 13:49:00,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:49:00,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 993 transitions. [2021-12-22 13:49:00,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.3) internal successors, (993), 10 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:00,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:00,918 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:00,918 INFO L186 Difference]: Start difference. First operand has 149 places, 143 transitions, 684 flow. Second operand 10 states and 993 transitions. [2021-12-22 13:49:00,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 200 transitions, 1305 flow [2021-12-22 13:49:00,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 200 transitions, 1287 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-12-22 13:49:00,927 INFO L242 Difference]: Finished difference. Result has 154 places, 147 transitions, 784 flow [2021-12-22 13:49:00,927 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=784, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2021-12-22 13:49:00,928 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2021-12-22 13:49:00,929 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 784 flow [2021-12-22 13:49:00,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:00,929 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:49:00,930 INFO L254 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, 1, 1, 1, 1] [2021-12-22 13:49:00,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 13:49:01,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-22 13:49:01,147 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:49:01,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:49:01,147 INFO L85 PathProgramCache]: Analyzing trace with hash -741365418, now seen corresponding path program 1 times [2021-12-22 13:49:01,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:49:01,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953985727] [2021-12-22 13:49:01,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:49:01,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:49:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:49:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:01,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:49:01,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953985727] [2021-12-22 13:49:01,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953985727] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:49:01,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815284518] [2021-12-22 13:49:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:49:01,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:49:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:49:01,270 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) [2021-12-22 13:49:01,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 13:49:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:49:01,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 13:49:01,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:49:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:01,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:49:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:01,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815284518] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 13:49:01,641 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 13:49:01,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2021-12-22 13:49:01,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033113851] [2021-12-22 13:49:01,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 13:49:01,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 13:49:01,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:49:01,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 13:49:01,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-22 13:49:01,642 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2021-12-22 13:49:01,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 784 flow. Second operand has 13 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:01,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:49:01,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2021-12-22 13:49:01,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:49:02,935 INFO L129 PetriNetUnfolder]: 6226/11076 cut-off events. [2021-12-22 13:49:02,936 INFO L130 PetriNetUnfolder]: For 41315/41315 co-relation queries the response was YES. [2021-12-22 13:49:02,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41208 conditions, 11076 events. 6226/11076 cut-off events. For 41315/41315 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 85950 event pairs, 994 based on Foata normal form. 886/11748 useless extension candidates. Maximal degree in co-relation 41188. Up to 2575 conditions per place. [2021-12-22 13:49:03,025 INFO L132 encePairwiseOnDemand]: 115/131 looper letters, 177 selfloop transitions, 55 changer transitions 21/320 dead transitions. [2021-12-22 13:49:03,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 320 transitions, 2270 flow [2021-12-22 13:49:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 13:49:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-22 13:49:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1787 transitions. [2021-12-22 13:49:03,028 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7179590196866211 [2021-12-22 13:49:03,028 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1787 transitions. [2021-12-22 13:49:03,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1787 transitions. [2021-12-22 13:49:03,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:49:03,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1787 transitions. [2021-12-22 13:49:03,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 94.05263157894737) internal successors, (1787), 19 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:03,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 131.0) internal successors, (2620), 20 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:03,036 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 131.0) internal successors, (2620), 20 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:03,036 INFO L186 Difference]: Start difference. First operand has 154 places, 147 transitions, 784 flow. Second operand 19 states and 1787 transitions. [2021-12-22 13:49:03,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 320 transitions, 2270 flow [2021-12-22 13:49:03,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 320 transitions, 2233 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-12-22 13:49:03,059 INFO L242 Difference]: Finished difference. Result has 178 places, 171 transitions, 1207 flow [2021-12-22 13:49:03,060 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1207, PETRI_PLACES=178, PETRI_TRANSITIONS=171} [2021-12-22 13:49:03,061 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2021-12-22 13:49:03,062 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 171 transitions, 1207 flow [2021-12-22 13:49:03,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:03,062 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:49:03,062 INFO L254 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, 1, 1, 1, 1, 1, 1] [2021-12-22 13:49:03,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-22 13:49:03,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:49:03,276 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:49:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:49:03,277 INFO L85 PathProgramCache]: Analyzing trace with hash 432141502, now seen corresponding path program 1 times [2021-12-22 13:49:03,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:49:03,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333518412] [2021-12-22 13:49:03,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:49:03,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:49:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:49:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:03,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:49:03,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333518412] [2021-12-22 13:49:03,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333518412] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:49:03,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115470041] [2021-12-22 13:49:03,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:49:03,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:49:03,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:49:03,434 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) [2021-12-22 13:49:03,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 13:49:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:49:03,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 13:49:03,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:49:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 13:49:03,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:49:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 13:49:04,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115470041] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-22 13:49:04,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-22 13:49:04,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2021-12-22 13:49:04,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118225757] [2021-12-22 13:49:04,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:49:04,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:49:04,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:49:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:49:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-12-22 13:49:04,141 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2021-12-22 13:49:04,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 171 transitions, 1207 flow. Second operand has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:04,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:49:04,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2021-12-22 13:49:04,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:49:04,878 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][153], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 7#L41true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), 35#L52true, Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:04,878 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-22 13:49:04,878 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:04,879 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:04,879 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:04,924 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter~0_80) 1 0)) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= v_~i2~0_24 (+ v_~i2~0_25 1)) (= (+ v_~counter~0_79 1) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_80, ~i2~0=v_~i2~0_25} OutVars{~counter~0=v_~counter~0_79, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~i2~0=v_~i2~0_24, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][82], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 30#L75true, 553#true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 137#true, 1202#(= ~i1~0 0), 155#(= ~i1~0 0), 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 7#L41true, 539#(= ~i1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:04,924 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-22 13:49:04,924 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:04,924 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:04,924 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:04,951 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][153], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 82#L74-1true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), 35#L52true, Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:04,951 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-22 13:49:04,951 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:04,951 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:04,951 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:04,952 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][171], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 30#L75true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 7#L41true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2509#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), 35#L52true, Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:04,952 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-22 13:49:04,952 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:04,952 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:04,952 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:05,108 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][130], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 30#L75true, 553#true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 32#L51-1true, 573#true, 137#true, 65#L44true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:05,109 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-22 13:49:05,109 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:05,109 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:05,109 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:05,110 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][153], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 35#L52true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:05,110 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-22 13:49:05,110 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:05,110 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:05,110 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:05,157 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][153], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 82#L74-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 555#(= ~j1~0 0), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 35#L52true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:05,157 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-12-22 13:49:05,157 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:05,157 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:05,157 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:05,158 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][171], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 30#L75true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2509#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 35#L52true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:05,158 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-12-22 13:49:05,158 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:05,158 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:05,158 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:05,223 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][264], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 30#L75true, 553#true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 32#L51-1true, 573#true, 137#true, 69#L98-4true, 65#L44true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 1357#(= (+ ~counter~0 (- 1)) 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 2509#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 85#L63-1true, Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 555#(= ~j1~0 0), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:05,223 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-22 13:49:05,223 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-22 13:49:05,223 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:05,223 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:05,554 INFO L129 PetriNetUnfolder]: 5683/11760 cut-off events. [2021-12-22 13:49:05,555 INFO L130 PetriNetUnfolder]: For 88476/89679 co-relation queries the response was YES. [2021-12-22 13:49:05,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53264 conditions, 11760 events. 5683/11760 cut-off events. For 88476/89679 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 105912 event pairs, 969 based on Foata normal form. 258/11125 useless extension candidates. Maximal degree in co-relation 53232. Up to 3992 conditions per place. [2021-12-22 13:49:05,695 INFO L132 encePairwiseOnDemand]: 120/131 looper letters, 200 selfloop transitions, 25 changer transitions 2/308 dead transitions. [2021-12-22 13:49:05,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 308 transitions, 3138 flow [2021-12-22 13:49:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:49:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:49:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 996 transitions. [2021-12-22 13:49:05,698 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7603053435114504 [2021-12-22 13:49:05,698 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 996 transitions. [2021-12-22 13:49:05,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 996 transitions. [2021-12-22 13:49:05,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:49:05,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 996 transitions. [2021-12-22 13:49:05,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.6) internal successors, (996), 10 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:05,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:05,705 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:05,705 INFO L186 Difference]: Start difference. First operand has 178 places, 171 transitions, 1207 flow. Second operand 10 states and 996 transitions. [2021-12-22 13:49:05,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 308 transitions, 3138 flow [2021-12-22 13:49:05,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 308 transitions, 2847 flow, removed 85 selfloop flow, removed 14 redundant places. [2021-12-22 13:49:05,769 INFO L242 Difference]: Finished difference. Result has 171 places, 182 transitions, 1283 flow [2021-12-22 13:49:05,769 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1283, PETRI_PLACES=171, PETRI_TRANSITIONS=182} [2021-12-22 13:49:05,770 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 54 predicate places. [2021-12-22 13:49:05,770 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 182 transitions, 1283 flow [2021-12-22 13:49:05,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:05,770 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:49:05,770 INFO L254 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, 1, 1] [2021-12-22 13:49:05,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 13:49:05,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:49:05,989 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:49:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:49:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash -687977584, now seen corresponding path program 2 times [2021-12-22 13:49:05,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:49:05,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72094872] [2021-12-22 13:49:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:49:05,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:49:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:49:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:06,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:49:06,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72094872] [2021-12-22 13:49:06,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72094872] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:49:06,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409967396] [2021-12-22 13:49:06,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 13:49:06,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:49:06,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:49:06,128 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) [2021-12-22 13:49:06,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 13:49:06,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 13:49:06,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 13:49:06,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 13:49:06,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:49:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:06,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:49:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:06,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409967396] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 13:49:06,952 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 13:49:06,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2021-12-22 13:49:06,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297935850] [2021-12-22 13:49:06,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 13:49:06,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-22 13:49:06,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:49:06,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-22 13:49:06,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2021-12-22 13:49:06,957 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-22 13:49:06,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 182 transitions, 1283 flow. Second operand has 24 states, 24 states have (on average 87.83333333333333) internal successors, (2108), 24 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:06,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:49:06,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-22 13:49:06,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:49:12,496 INFO L129 PetriNetUnfolder]: 26368/50183 cut-off events. [2021-12-22 13:49:12,496 INFO L130 PetriNetUnfolder]: For 298653/298811 co-relation queries the response was YES. [2021-12-22 13:49:12,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211132 conditions, 50183 events. 26368/50183 cut-off events. For 298653/298811 co-relation queries the response was YES. Maximal size of possible extension queue 3044. Compared 521730 event pairs, 3922 based on Foata normal form. 2336/51932 useless extension candidates. Maximal degree in co-relation 211103. Up to 8499 conditions per place. [2021-12-22 13:49:13,046 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 558 selfloop transitions, 95 changer transitions 12/733 dead transitions. [2021-12-22 13:49:13,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 733 transitions, 8145 flow [2021-12-22 13:49:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-22 13:49:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-12-22 13:49:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2482 transitions. [2021-12-22 13:49:13,050 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7287140340575455 [2021-12-22 13:49:13,050 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2482 transitions. [2021-12-22 13:49:13,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2482 transitions. [2021-12-22 13:49:13,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:49:13,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2482 transitions. [2021-12-22 13:49:13,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 95.46153846153847) internal successors, (2482), 26 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:13,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 131.0) internal successors, (3537), 27 states have internal predecessors, (3537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:13,058 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 131.0) internal successors, (3537), 27 states have internal predecessors, (3537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:13,058 INFO L186 Difference]: Start difference. First operand has 171 places, 182 transitions, 1283 flow. Second operand 26 states and 2482 transitions. [2021-12-22 13:49:13,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 733 transitions, 8145 flow [2021-12-22 13:49:13,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 733 transitions, 7878 flow, removed 130 selfloop flow, removed 4 redundant places. [2021-12-22 13:49:13,440 INFO L242 Difference]: Finished difference. Result has 208 places, 245 transitions, 2344 flow [2021-12-22 13:49:13,441 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2344, PETRI_PLACES=208, PETRI_TRANSITIONS=245} [2021-12-22 13:49:13,441 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 91 predicate places. [2021-12-22 13:49:13,441 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 245 transitions, 2344 flow [2021-12-22 13:49:13,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 87.83333333333333) internal successors, (2108), 24 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:13,442 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:49:13,442 INFO L254 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, 1, 1] [2021-12-22 13:49:13,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-22 13:49:13,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-22 13:49:13,657 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:49:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:49:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash 982740406, now seen corresponding path program 3 times [2021-12-22 13:49:13,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:49:13,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294530430] [2021-12-22 13:49:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:49:13,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:49:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:49:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:13,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:49:13,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294530430] [2021-12-22 13:49:13,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294530430] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:49:13,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238821613] [2021-12-22 13:49:13,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 13:49:13,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:49:13,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:49:13,779 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) [2021-12-22 13:49:13,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 13:49:13,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-22 13:49:13,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 13:49:13,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 13:49:13,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:49:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 13:49:14,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:49:14,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238821613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:49:14,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:49:14,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-12-22 13:49:14,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003410024] [2021-12-22 13:49:14,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:49:14,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:49:14,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:49:14,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:49:14,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:49:14,270 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2021-12-22 13:49:14,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 245 transitions, 2344 flow. Second operand has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:14,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:49:14,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2021-12-22 13:49:14,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:49:17,474 INFO L129 PetriNetUnfolder]: 10650/26189 cut-off events. [2021-12-22 13:49:17,474 INFO L130 PetriNetUnfolder]: For 313006/316351 co-relation queries the response was YES. [2021-12-22 13:49:17,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136539 conditions, 26189 events. 10650/26189 cut-off events. For 313006/316351 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 304488 event pairs, 3587 based on Foata normal form. 172/25010 useless extension candidates. Maximal degree in co-relation 136494. Up to 11500 conditions per place. [2021-12-22 13:49:17,937 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 156 selfloop transitions, 25 changer transitions 3/270 dead transitions. [2021-12-22 13:49:17,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 270 transitions, 3063 flow [2021-12-22 13:49:17,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:49:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:49:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2021-12-22 13:49:17,939 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7351145038167939 [2021-12-22 13:49:17,939 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2021-12-22 13:49:17,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2021-12-22 13:49:17,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:49:17,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2021-12-22 13:49:17,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:17,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:17,942 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:17,942 INFO L186 Difference]: Start difference. First operand has 208 places, 245 transitions, 2344 flow. Second operand 10 states and 963 transitions. [2021-12-22 13:49:17,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 270 transitions, 3063 flow [2021-12-22 13:49:18,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 270 transitions, 2842 flow, removed 84 selfloop flow, removed 9 redundant places. [2021-12-22 13:49:18,338 INFO L242 Difference]: Finished difference. Result has 204 places, 237 transitions, 2103 flow [2021-12-22 13:49:18,338 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2103, PETRI_PLACES=204, PETRI_TRANSITIONS=237} [2021-12-22 13:49:18,338 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 87 predicate places. [2021-12-22 13:49:18,339 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 237 transitions, 2103 flow [2021-12-22 13:49:18,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:18,339 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:49:18,339 INFO L254 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, 1, 1, 1, 1, 1, 1] [2021-12-22 13:49:18,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 13:49:18,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:49:18,540 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:49:18,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:49:18,540 INFO L85 PathProgramCache]: Analyzing trace with hash 822271266, now seen corresponding path program 2 times [2021-12-22 13:49:18,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:49:18,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556319104] [2021-12-22 13:49:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:49:18,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:49:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:49:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:49:18,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:49:18,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556319104] [2021-12-22 13:49:18,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556319104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:49:18,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:49:18,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:49:18,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273795938] [2021-12-22 13:49:18,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:49:18,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:49:18,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:49:18,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:49:18,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:49:18,650 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-22 13:49:18,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 237 transitions, 2103 flow. Second operand has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:18,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:49:18,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-22 13:49:18,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:49:23,448 INFO L129 PetriNetUnfolder]: 22812/40363 cut-off events. [2021-12-22 13:49:23,448 INFO L130 PetriNetUnfolder]: For 413664/413703 co-relation queries the response was YES. [2021-12-22 13:49:23,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 213869 conditions, 40363 events. 22812/40363 cut-off events. For 413664/413703 co-relation queries the response was YES. Maximal size of possible extension queue 2500. Compared 375455 event pairs, 13066 based on Foata normal form. 43/39806 useless extension candidates. Maximal degree in co-relation 213823. Up to 30527 conditions per place. [2021-12-22 13:49:24,203 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 169 selfloop transitions, 28 changer transitions 15/280 dead transitions. [2021-12-22 13:49:24,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 280 transitions, 3030 flow [2021-12-22 13:49:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:49:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:49:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 910 transitions. [2021-12-22 13:49:24,204 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6946564885496184 [2021-12-22 13:49:24,204 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 910 transitions. [2021-12-22 13:49:24,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 910 transitions. [2021-12-22 13:49:24,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:49:24,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 910 transitions. [2021-12-22 13:49:24,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:24,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:24,207 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:24,207 INFO L186 Difference]: Start difference. First operand has 204 places, 237 transitions, 2103 flow. Second operand 10 states and 910 transitions. [2021-12-22 13:49:24,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 280 transitions, 3030 flow [2021-12-22 13:49:24,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 280 transitions, 2949 flow, removed 8 selfloop flow, removed 12 redundant places. [2021-12-22 13:49:24,892 INFO L242 Difference]: Finished difference. Result has 200 places, 239 transitions, 2166 flow [2021-12-22 13:49:24,892 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2166, PETRI_PLACES=200, PETRI_TRANSITIONS=239} [2021-12-22 13:49:24,892 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 83 predicate places. [2021-12-22 13:49:24,893 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 239 transitions, 2166 flow [2021-12-22 13:49:24,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:24,893 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:49:24,893 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:49:24,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 13:49:24,893 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:49:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:49:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1431070086, now seen corresponding path program 1 times [2021-12-22 13:49:24,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:49:24,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183524673] [2021-12-22 13:49:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:49:24,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:49:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:49:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 13:49:24,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:49:24,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183524673] [2021-12-22 13:49:24,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183524673] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:49:24,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453298712] [2021-12-22 13:49:24,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:49:24,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:49:24,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:49:24,954 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) [2021-12-22 13:49:24,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 13:49:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:49:25,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-22 13:49:25,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:49:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 13:49:25,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:49:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 13:49:26,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453298712] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 13:49:26,694 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 13:49:26,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2021-12-22 13:49:26,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809905690] [2021-12-22 13:49:26,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 13:49:26,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:49:26,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:49:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:49:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:49:26,696 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2021-12-22 13:49:26,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 239 transitions, 2166 flow. Second operand has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:49:26,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:49:26,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2021-12-22 13:49:26,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:49:27,073 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 137#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 1894#(<= 0 ~i1~0), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 58#L97-4true, 1357#(= (+ ~counter~0 (- 1)) 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 2551#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:27,074 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-22 13:49:27,074 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-22 13:49:27,074 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-22 13:49:27,074 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-22 13:49:27,087 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][174], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 1894#(<= 0 ~i1~0), 65#L44true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 58#L97-4true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 2551#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 85#L63-1true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:27,087 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-22 13:49:27,087 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-22 13:49:27,087 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-22 13:49:27,087 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-22 13:49:27,519 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][232], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 35#L52true, 3550#true, 520#(= ~i2~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:27,519 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-22 13:49:27,519 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-22 13:49:27,519 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-22 13:49:27,519 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-22 13:49:27,522 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][146], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 3550#true, 35#L52true, 520#(= ~i2~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:27,522 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,522 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,522 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,522 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,716 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][179], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 520#(= ~i2~0 0)]) [2021-12-22 13:49:27,716 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,716 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,716 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,716 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,760 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][237], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:27,760 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2021-12-22 13:49:27,760 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2021-12-22 13:49:27,760 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2021-12-22 13:49:27,760 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2021-12-22 13:49:27,916 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:27,917 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-22 13:49:27,917 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:27,917 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,917 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:27,968 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][237], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:27,968 INFO L384 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2021-12-22 13:49:27,968 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2021-12-22 13:49:27,968 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2021-12-22 13:49:27,968 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2021-12-22 13:49:28,032 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][221], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 35#L52true, 3550#true, 520#(= ~i2~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,032 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,032 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:28,032 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:28,032 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:28,070 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, 137#true, Black: 1894#(<= 0 ~i1~0), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, 7#L41true, 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 3550#true, 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,070 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,070 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,070 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-22 13:49:28,070 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-22 13:49:28,128 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][174], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 1894#(<= 0 ~i1~0), 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,129 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,129 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,129 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-22 13:49:28,129 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-22 13:49:28,129 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][267], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), 1202#(= ~i1~0 0), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, 1894#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 2516#(= ~i1~0 0), 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 7#L41true, 3552#(= ~i1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,129 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,129 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-22 13:49:28,129 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-22 13:49:28,129 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,159 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,159 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,159 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:28,159 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,159 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:28,170 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 1248#(= ~counter~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 35#L52true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,170 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,170 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:28,170 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:28,170 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:28,190 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,190 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,190 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,190 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,190 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,197 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][237], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, 35#L52true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,197 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,197 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,197 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,197 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:28,618 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,618 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,618 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,618 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,618 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,634 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1248#(= ~counter~0 0), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, 65#L44true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,634 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,634 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,634 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,634 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,634 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,634 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,634 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,634 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,634 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,640 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][267], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), 1202#(= ~i1~0 0), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 573#true, 1894#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 2516#(= ~i1~0 0), 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 7#L41true, 3552#(= ~i1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,641 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,641 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-22 13:49:28,641 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-22 13:49:28,641 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,641 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:28,642 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,642 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,642 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,642 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,642 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,746 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,746 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2021-12-22 13:49:28,746 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2021-12-22 13:49:28,747 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2021-12-22 13:49:28,747 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2021-12-22 13:49:28,747 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,747 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,747 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,747 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,747 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,747 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,830 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][146], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,831 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,831 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,831 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,831 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,933 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1248#(= ~counter~0 0), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,933 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,933 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,933 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,933 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,934 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 1248#(= ~counter~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, 3571#(= ~counter~0 0), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 35#L52true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:28,934 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,934 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:28,934 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:28,934 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:28,934 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-22 13:49:29,238 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,243 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-22 13:49:29,244 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:29,244 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:29,244 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:29,366 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][207], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 1357#(= (+ ~counter~0 (- 1)) 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 85#L63-1true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,366 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-12-22 13:49:29,366 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:29,366 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2021-12-22 13:49:29,366 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-22 13:49:29,373 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,373 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-12-22 13:49:29,373 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:29,373 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2021-12-22 13:49:29,373 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:29,524 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][179], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,524 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-22 13:49:29,524 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:29,524 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:29,524 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:29,535 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][232], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,535 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-22 13:49:29,535 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:29,535 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:29,535 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-22 13:49:29,535 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter~0_80) 1 0)) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= v_~i2~0_24 (+ v_~i2~0_25 1)) (= (+ v_~counter~0_79 1) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_80, ~i2~0=v_~i2~0_25} OutVars{~counter~0=v_~counter~0_79, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~i2~0=v_~i2~0_24, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][307], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, 7#L41true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,535 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-22 13:49:29,535 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:29,536 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-22 13:49:29,536 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-22 13:49:29,687 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, 555#(= ~j1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,687 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-22 13:49:29,687 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:29,687 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:29,688 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:29,773 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 107#L99-2true, 1009#(or (< ~i1~0 ~N1~0) (not (< ~j1~0 ~M1~0))), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,774 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,774 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,774 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,774 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,782 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 107#L99-2true, 1009#(or (< ~i1~0 ~N1~0) (not (< ~j1~0 ~M1~0))), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true]) [2021-12-22 13:49:29,783 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,783 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,783 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,783 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,788 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,788 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,788 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:29,788 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:29,788 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:29,788 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:29,789 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-12-22 13:49:29,789 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:29,789 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:29,789 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-22 13:49:30,099 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][221], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:30,099 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-22 13:49:30,099 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,099 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,099 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-22 13:49:30,135 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:30,135 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-22 13:49:30,135 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,135 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,135 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,136 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:30,136 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-22 13:49:30,136 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,136 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,136 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,136 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,136 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-22 13:49:30,140 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][237], [111#L64true, Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, 107#L99-2true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, 35#L52true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:30,140 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-22 13:49:30,140 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-22 13:49:30,140 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-22 13:49:30,140 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-22 13:49:30,244 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] 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[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, 555#(= ~j1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:30,244 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2021-12-22 13:49:30,244 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-22 13:49:30,244 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-22 13:49:30,244 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-22 13:49:30,309 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 111#L64true, Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), 573#true, Black: 2551#(<= 0 ~i1~0), 107#L99-2true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:30,309 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-12-22 13:49:30,309 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-22 13:49:30,309 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-22 13:49:30,310 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-22 13:49:30,460 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, 107#L99-2true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1248#(= ~counter~0 0), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:30,460 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2021-12-22 13:49:30,460 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-22 13:49:30,460 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-22 13:49:30,460 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-22 13:49:30,460 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, 107#L99-2true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1248#(= ~counter~0 0), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 35#L52true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:30,460 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2021-12-22 13:49:30,461 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-22 13:49:30,461 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-22 13:49:30,461 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-22 13:49:30,609 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 111#L64true, Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, 107#L99-2true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 2551#(<= 0 ~i1~0), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-22 13:49:30,609 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2021-12-22 13:49:30,609 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-22 13:49:30,609 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-22 13:49:30,609 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-22 13:49:31,001 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 137#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 94#L100-2true, 1009#(or (< ~i1~0 ~N1~0) (not (< ~j1~0 ~M1~0))), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~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)) (= ~N2~0 ~N1~0)), 1200#true, 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2021-12-22 13:49:31,002 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-22 13:49:31,002 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-22 13:49:31,002 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-22 13:49:31,002 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event