/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 08:52:21,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 08:52:21,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 08:52:21,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 08:52:21,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 08:52:21,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 08:52:21,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 08:52:21,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 08:52:21,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 08:52:21,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 08:52:21,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 08:52:21,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 08:52:21,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 08:52:21,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 08:52:21,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 08:52:21,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 08:52:21,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 08:52:21,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 08:52:21,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 08:52:21,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 08:52:21,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 08:52:21,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 08:52:21,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 08:52:21,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 08:52:21,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 08:52:21,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 08:52:21,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 08:52:21,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 08:52:21,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 08:52:21,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 08:52:21,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 08:52:21,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 08:52:21,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 08:52:21,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 08:52:21,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 08:52:21,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 08:52:21,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 08:52:21,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 08:52:21,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 08:52:21,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 08:52:21,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 08:52:21,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 08:52:21,740 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 08:52:21,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 08:52:21,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 08:52:21,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 08:52:21,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 08:52:21,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 08:52:21,741 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 08:52:21,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 08:52:21,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 08:52:21,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 08:52:21,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 08:52:21,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 08:52:21,743 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 08:52:21,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 08:52:21,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 08:52:21,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 08:52:21,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 08:52:21,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 08:52:21,913 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 08:52:21,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-01-19 08:52:21,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4f590c4/036bd410eb5b42b1a4b871d04bfd13d2/FLAGd41bc6551 [2022-01-19 08:52:22,328 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 08:52:22,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-01-19 08:52:22,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4f590c4/036bd410eb5b42b1a4b871d04bfd13d2/FLAGd41bc6551 [2022-01-19 08:52:22,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4f590c4/036bd410eb5b42b1a4b871d04bfd13d2 [2022-01-19 08:52:22,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 08:52:22,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 08:52:22,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 08:52:22,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 08:52:22,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 08:52:22,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bce7280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22, skipping insertion in model container [2022-01-19 08:52:22,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 08:52:22,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 08:52:22,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-01-19 08:52:22,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 08:52:22,572 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 08:52:22,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-01-19 08:52:22,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 08:52:22,614 INFO L208 MainTranslator]: Completed translation [2022-01-19 08:52:22,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22 WrapperNode [2022-01-19 08:52:22,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 08:52:22,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 08:52:22,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 08:52:22,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 08:52:22,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,656 INFO L137 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2022-01-19 08:52:22,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 08:52:22,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 08:52:22,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 08:52:22,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 08:52:22,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 08:52:22,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 08:52:22,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 08:52:22,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 08:52:22,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (1/1) ... [2022-01-19 08:52:22,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 08:52:22,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:52:22,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 08:52:22,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 08:52:22,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 08:52:22,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 08:52:22,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 08:52:22,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 08:52:22,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 08:52:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 08:52:22,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 08:52:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 08:52:22,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 08:52:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 08:52:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 08:52:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 08:52:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 08:52:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 08:52:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 08:52:22,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 08:52:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 08:52:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 08:52:22,762 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 08:52:22,829 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 08:52:22,830 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 08:52:23,023 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 08:52:23,057 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 08:52:23,057 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 08:52:23,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 08:52:23 BoogieIcfgContainer [2022-01-19 08:52:23,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 08:52:23,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 08:52:23,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 08:52:23,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 08:52:23,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 08:52:22" (1/3) ... [2022-01-19 08:52:23,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c52cc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 08:52:23, skipping insertion in model container [2022-01-19 08:52:23,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:52:22" (2/3) ... [2022-01-19 08:52:23,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c52cc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 08:52:23, skipping insertion in model container [2022-01-19 08:52:23,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 08:52:23" (3/3) ... [2022-01-19 08:52:23,064 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-01-19 08:52:23,067 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 08:52:23,067 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 08:52:23,067 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 08:52:23,100 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,101 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,101 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,101 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,101 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,101 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,101 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,101 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,105 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,108 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,108 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,108 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,108 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,108 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,108 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,108 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,108 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,109 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,109 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,109 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,109 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,113 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,113 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,113 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,113 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,113 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,113 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:52:23,122 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 08:52:23,152 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 08:52:23,156 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 08:52:23,156 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 08:52:23,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 131 transitions, 294 flow [2022-01-19 08:52:23,196 INFO L129 PetriNetUnfolder]: 10/127 cut-off events. [2022-01-19 08:52:23,196 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 08:52:23,199 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. [2022-01-19 08:52:23,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 131 transitions, 294 flow [2022-01-19 08:52:23,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 114 transitions, 252 flow [2022-01-19 08:52:23,231 INFO L129 PetriNetUnfolder]: 10/113 cut-off events. [2022-01-19 08:52:23,231 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 08:52:23,231 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:23,232 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] [2022-01-19 08:52:23,232 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)] === [2022-01-19 08:52:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1069838279, now seen corresponding path program 1 times [2022-01-19 08:52:23,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:23,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75920292] [2022-01-19 08:52:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:23,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:23,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:23,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75920292] [2022-01-19 08:52:23,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75920292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:23,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:52:23,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 08:52:23,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145155432] [2022-01-19 08:52:23,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:23,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 08:52:23,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:23,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 08:52:23,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 08:52:23,428 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 131 [2022-01-19 08:52:23,431 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) [2022-01-19 08:52:23,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:23,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 131 [2022-01-19 08:52:23,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:23,476 INFO L129 PetriNetUnfolder]: 16/120 cut-off events. [2022-01-19 08:52:23,477 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 08:52:23,478 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. [2022-01-19 08:52:23,480 INFO L132 encePairwiseOnDemand]: 125/131 looper letters, 12 selfloop transitions, 0 changer transitions 2/108 dead transitions. [2022-01-19 08:52:23,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 264 flow [2022-01-19 08:52:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 08:52:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 08:52:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2022-01-19 08:52:23,490 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2022-01-19 08:52:23,491 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 242 transitions. [2022-01-19 08:52:23,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 242 transitions. [2022-01-19 08:52:23,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:23,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 242 transitions. [2022-01-19 08:52:23,498 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) [2022-01-19 08:52:23,502 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) [2022-01-19 08:52:23,503 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) [2022-01-19 08:52:23,504 INFO L186 Difference]: Start difference. First operand has 117 places, 114 transitions, 252 flow. Second operand 2 states and 242 transitions. [2022-01-19 08:52:23,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 264 flow [2022-01-19 08:52:23,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 108 transitions, 248 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 08:52:23,511 INFO L242 Difference]: Finished difference. Result has 110 places, 106 transitions, 220 flow [2022-01-19 08:52:23,512 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} [2022-01-19 08:52:23,516 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -7 predicate places. [2022-01-19 08:52:23,517 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 220 flow [2022-01-19 08:52:23,517 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) [2022-01-19 08:52:23,517 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:23,517 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] [2022-01-19 08:52:23,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 08:52:23,518 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)] === [2022-01-19 08:52:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:23,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1574494246, now seen corresponding path program 1 times [2022-01-19 08:52:23,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:23,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704641681] [2022-01-19 08:52:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:23,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:23,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:23,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704641681] [2022-01-19 08:52:23,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704641681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:23,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:52:23,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 08:52:23,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545134347] [2022-01-19 08:52:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:23,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 08:52:23,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:23,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 08:52:23,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 08:52:23,752 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2022-01-19 08:52:23,753 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) [2022-01-19 08:52:23,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:23,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2022-01-19 08:52:23,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:23,858 INFO L129 PetriNetUnfolder]: 23/173 cut-off events. [2022-01-19 08:52:23,859 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 08:52:23,860 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. [2022-01-19 08:52:23,861 INFO L132 encePairwiseOnDemand]: 123/131 looper letters, 25 selfloop transitions, 3 changer transitions 5/118 dead transitions. [2022-01-19 08:52:23,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 317 flow [2022-01-19 08:52:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 08:52:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 08:52:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2022-01-19 08:52:23,866 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8259541984732824 [2022-01-19 08:52:23,866 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2022-01-19 08:52:23,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2022-01-19 08:52:23,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:23,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2022-01-19 08:52:23,868 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) [2022-01-19 08:52:23,871 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) [2022-01-19 08:52:23,871 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) [2022-01-19 08:52:23,871 INFO L186 Difference]: Start difference. First operand has 110 places, 106 transitions, 220 flow. Second operand 5 states and 541 transitions. [2022-01-19 08:52:23,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 317 flow [2022-01-19 08:52:23,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 118 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 08:52:23,875 INFO L242 Difference]: Finished difference. Result has 115 places, 108 transitions, 247 flow [2022-01-19 08:52:23,875 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} [2022-01-19 08:52:23,876 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2022-01-19 08:52:23,876 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 247 flow [2022-01-19 08:52:23,876 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) [2022-01-19 08:52:23,876 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:23,877 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] [2022-01-19 08:52:23,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 08:52:23,877 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)] === [2022-01-19 08:52:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash -575216244, now seen corresponding path program 1 times [2022-01-19 08:52:23,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:23,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129659824] [2022-01-19 08:52:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:23,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:24,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:24,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129659824] [2022-01-19 08:52:24,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129659824] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:24,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:52:24,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 08:52:24,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686106202] [2022-01-19 08:52:24,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:24,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 08:52:24,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:24,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 08:52:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-19 08:52:24,138 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 08:52:24,139 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) [2022-01-19 08:52:24,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:24,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 08:52:24,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:24,606 INFO L129 PetriNetUnfolder]: 2030/3464 cut-off events. [2022-01-19 08:52:24,607 INFO L130 PetriNetUnfolder]: For 591/703 co-relation queries the response was YES. [2022-01-19 08:52:24,615 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. [2022-01-19 08:52:24,634 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 107 selfloop transitions, 12 changer transitions 0/187 dead transitions. [2022-01-19 08:52:24,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 187 transitions, 714 flow [2022-01-19 08:52:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 08:52:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 08:52:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 874 transitions. [2022-01-19 08:52:24,637 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741306191687871 [2022-01-19 08:52:24,637 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 874 transitions. [2022-01-19 08:52:24,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 874 transitions. [2022-01-19 08:52:24,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:24,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 874 transitions. [2022-01-19 08:52:24,642 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) [2022-01-19 08:52:24,644 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) [2022-01-19 08:52:24,645 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) [2022-01-19 08:52:24,645 INFO L186 Difference]: Start difference. First operand has 115 places, 108 transitions, 247 flow. Second operand 9 states and 874 transitions. [2022-01-19 08:52:24,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 187 transitions, 714 flow [2022-01-19 08:52:24,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 187 transitions, 694 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-01-19 08:52:24,652 INFO L242 Difference]: Finished difference. Result has 122 places, 114 transitions, 315 flow [2022-01-19 08:52:24,652 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} [2022-01-19 08:52:24,654 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2022-01-19 08:52:24,654 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 315 flow [2022-01-19 08:52:24,654 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) [2022-01-19 08:52:24,654 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:24,654 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] [2022-01-19 08:52:24,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 08:52:24,655 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)] === [2022-01-19 08:52:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1075191398, now seen corresponding path program 2 times [2022-01-19 08:52:24,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:24,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617610322] [2022-01-19 08:52:24,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:24,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:24,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:24,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617610322] [2022-01-19 08:52:24,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617610322] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:24,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234936264] [2022-01-19 08:52:24,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 08:52:24,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:52:24,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:52:24,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:52:24,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 08:52:24,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 08:52:24,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:52:25,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 08:52:25,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:52:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:25,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 08:52:25,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234936264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:25,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 08:52:25,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-01-19 08:52:25,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367305689] [2022-01-19 08:52:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:25,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:52:25,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:52:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-01-19 08:52:25,380 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 08:52:25,381 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) [2022-01-19 08:52:25,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:25,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 08:52:25,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:25,576 INFO L129 PetriNetUnfolder]: 319/720 cut-off events. [2022-01-19 08:52:25,576 INFO L130 PetriNetUnfolder]: For 450/462 co-relation queries the response was YES. [2022-01-19 08:52:25,578 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. [2022-01-19 08:52:25,581 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 50 selfloop transitions, 12 changer transitions 0/138 dead transitions. [2022-01-19 08:52:25,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 138 transitions, 522 flow [2022-01-19 08:52:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 08:52:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 08:52:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 975 transitions. [2022-01-19 08:52:25,584 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7442748091603053 [2022-01-19 08:52:25,584 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 975 transitions. [2022-01-19 08:52:25,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 975 transitions. [2022-01-19 08:52:25,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:25,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 975 transitions. [2022-01-19 08:52:25,586 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) [2022-01-19 08:52:25,587 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) [2022-01-19 08:52:25,587 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) [2022-01-19 08:52:25,587 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 315 flow. Second operand 10 states and 975 transitions. [2022-01-19 08:52:25,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 138 transitions, 522 flow [2022-01-19 08:52:25,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 513 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 08:52:25,596 INFO L242 Difference]: Finished difference. Result has 130 places, 117 transitions, 357 flow [2022-01-19 08:52:25,596 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} [2022-01-19 08:52:25,597 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 13 predicate places. [2022-01-19 08:52:25,597 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 357 flow [2022-01-19 08:52:25,598 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) [2022-01-19 08:52:25,598 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:25,598 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] [2022-01-19 08:52:25,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 08:52:25,812 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 [2022-01-19 08:52:25,813 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)] === [2022-01-19 08:52:25,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash -956916982, now seen corresponding path program 1 times [2022-01-19 08:52:25,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:25,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005766175] [2022-01-19 08:52:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:25,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:25,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:25,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005766175] [2022-01-19 08:52:25,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005766175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:25,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:52:25,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:52:25,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664339105] [2022-01-19 08:52:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:25,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:52:25,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:25,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:52:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:52:25,920 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 08:52:25,920 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) [2022-01-19 08:52:25,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:25,920 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 08:52:25,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:26,374 INFO L129 PetriNetUnfolder]: 1977/3728 cut-off events. [2022-01-19 08:52:26,374 INFO L130 PetriNetUnfolder]: For 3939/4031 co-relation queries the response was YES. [2022-01-19 08:52:26,380 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. [2022-01-19 08:52:26,396 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 98 selfloop transitions, 15 changer transitions 6/187 dead transitions. [2022-01-19 08:52:26,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 187 transitions, 870 flow [2022-01-19 08:52:26,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 08:52:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 08:52:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2022-01-19 08:52:26,398 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7229007633587786 [2022-01-19 08:52:26,398 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 947 transitions. [2022-01-19 08:52:26,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 947 transitions. [2022-01-19 08:52:26,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:26,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 947 transitions. [2022-01-19 08:52:26,400 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) [2022-01-19 08:52:26,401 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) [2022-01-19 08:52:26,402 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) [2022-01-19 08:52:26,402 INFO L186 Difference]: Start difference. First operand has 130 places, 117 transitions, 357 flow. Second operand 10 states and 947 transitions. [2022-01-19 08:52:26,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 187 transitions, 870 flow [2022-01-19 08:52:26,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 187 transitions, 854 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 08:52:26,409 INFO L242 Difference]: Finished difference. Result has 135 places, 121 transitions, 403 flow [2022-01-19 08:52:26,409 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} [2022-01-19 08:52:26,411 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2022-01-19 08:52:26,411 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 121 transitions, 403 flow [2022-01-19 08:52:26,411 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) [2022-01-19 08:52:26,412 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:26,412 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] [2022-01-19 08:52:26,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 08:52:26,412 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)] === [2022-01-19 08:52:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash 158599598, now seen corresponding path program 2 times [2022-01-19 08:52:26,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:26,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219501505] [2022-01-19 08:52:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:26,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:26,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:26,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219501505] [2022-01-19 08:52:26,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219501505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:26,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:52:26,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:52:26,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942342997] [2022-01-19 08:52:26,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:26,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:52:26,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:26,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:52:26,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:52:26,547 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 08:52:26,548 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) [2022-01-19 08:52:26,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:26,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 08:52:26,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:26,948 INFO L129 PetriNetUnfolder]: 2339/4309 cut-off events. [2022-01-19 08:52:26,948 INFO L130 PetriNetUnfolder]: For 5757/5798 co-relation queries the response was YES. [2022-01-19 08:52:26,961 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. [2022-01-19 08:52:26,981 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 102 selfloop transitions, 19 changer transitions 6/195 dead transitions. [2022-01-19 08:52:26,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 195 transitions, 980 flow [2022-01-19 08:52:26,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 08:52:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 08:52:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2022-01-19 08:52:26,983 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7251908396946565 [2022-01-19 08:52:26,983 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 950 transitions. [2022-01-19 08:52:26,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 950 transitions. [2022-01-19 08:52:26,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:26,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 950 transitions. [2022-01-19 08:52:26,985 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) [2022-01-19 08:52:26,986 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) [2022-01-19 08:52:26,986 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) [2022-01-19 08:52:26,986 INFO L186 Difference]: Start difference. First operand has 135 places, 121 transitions, 403 flow. Second operand 10 states and 950 transitions. [2022-01-19 08:52:26,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 195 transitions, 980 flow [2022-01-19 08:52:26,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 195 transitions, 959 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 08:52:26,995 INFO L242 Difference]: Finished difference. Result has 140 places, 128 transitions, 490 flow [2022-01-19 08:52:26,995 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} [2022-01-19 08:52:26,996 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2022-01-19 08:52:26,996 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 490 flow [2022-01-19 08:52:26,996 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) [2022-01-19 08:52:26,996 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:26,996 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] [2022-01-19 08:52:26,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 08:52:26,997 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)] === [2022-01-19 08:52:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1067075906, now seen corresponding path program 3 times [2022-01-19 08:52:26,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:26,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524390702] [2022-01-19 08:52:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:26,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:27,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:27,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524390702] [2022-01-19 08:52:27,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524390702] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:27,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:52:27,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:52:27,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585971748] [2022-01-19 08:52:27,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:27,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:52:27,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:27,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:52:27,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:52:27,091 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 08:52:27,092 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) [2022-01-19 08:52:27,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:27,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 08:52:27,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:27,472 INFO L129 PetriNetUnfolder]: 2280/4136 cut-off events. [2022-01-19 08:52:27,472 INFO L130 PetriNetUnfolder]: For 7452/7576 co-relation queries the response was YES. [2022-01-19 08:52:27,485 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. [2022-01-19 08:52:27,502 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 83 selfloop transitions, 14 changer transitions 10/175 dead transitions. [2022-01-19 08:52:27,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 913 flow [2022-01-19 08:52:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 08:52:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 08:52:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 759 transitions. [2022-01-19 08:52:27,504 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7242366412213741 [2022-01-19 08:52:27,504 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 759 transitions. [2022-01-19 08:52:27,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 759 transitions. [2022-01-19 08:52:27,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:27,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 759 transitions. [2022-01-19 08:52:27,506 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) [2022-01-19 08:52:27,507 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) [2022-01-19 08:52:27,507 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) [2022-01-19 08:52:27,507 INFO L186 Difference]: Start difference. First operand has 140 places, 128 transitions, 490 flow. Second operand 8 states and 759 transitions. [2022-01-19 08:52:27,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 175 transitions, 913 flow [2022-01-19 08:52:27,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 175 transitions, 899 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 08:52:27,515 INFO L242 Difference]: Finished difference. Result has 143 places, 128 transitions, 508 flow [2022-01-19 08:52:27,516 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} [2022-01-19 08:52:27,516 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2022-01-19 08:52:27,516 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 128 transitions, 508 flow [2022-01-19 08:52:27,517 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) [2022-01-19 08:52:27,517 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:27,517 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] [2022-01-19 08:52:27,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 08:52:27,517 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)] === [2022-01-19 08:52:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash 616937690, now seen corresponding path program 4 times [2022-01-19 08:52:27,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:27,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861022202] [2022-01-19 08:52:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:27,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:27,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:27,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861022202] [2022-01-19 08:52:27,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861022202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:27,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:52:27,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:52:27,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307475316] [2022-01-19 08:52:27,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:27,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:52:27,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:27,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:52:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:52:27,614 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 08:52:27,614 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) [2022-01-19 08:52:27,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:27,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 08:52:27,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:28,194 INFO L129 PetriNetUnfolder]: 3385/6203 cut-off events. [2022-01-19 08:52:28,194 INFO L130 PetriNetUnfolder]: For 13151/13207 co-relation queries the response was YES. [2022-01-19 08:52:28,216 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. [2022-01-19 08:52:28,250 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 118 selfloop transitions, 26 changer transitions 1/213 dead transitions. [2022-01-19 08:52:28,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 213 transitions, 1284 flow [2022-01-19 08:52:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 08:52:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 08:52:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 945 transitions. [2022-01-19 08:52:28,253 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7213740458015268 [2022-01-19 08:52:28,253 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 945 transitions. [2022-01-19 08:52:28,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 945 transitions. [2022-01-19 08:52:28,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:28,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 945 transitions. [2022-01-19 08:52:28,255 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) [2022-01-19 08:52:28,257 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) [2022-01-19 08:52:28,257 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) [2022-01-19 08:52:28,258 INFO L186 Difference]: Start difference. First operand has 143 places, 128 transitions, 508 flow. Second operand 10 states and 945 transitions. [2022-01-19 08:52:28,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 213 transitions, 1284 flow [2022-01-19 08:52:28,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 213 transitions, 1253 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-01-19 08:52:28,268 INFO L242 Difference]: Finished difference. Result has 149 places, 143 transitions, 684 flow [2022-01-19 08:52:28,268 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} [2022-01-19 08:52:28,269 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2022-01-19 08:52:28,270 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 684 flow [2022-01-19 08:52:28,270 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) [2022-01-19 08:52:28,270 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:28,270 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] [2022-01-19 08:52:28,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 08:52:28,270 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)] === [2022-01-19 08:52:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:28,271 INFO L85 PathProgramCache]: Analyzing trace with hash 721298320, now seen corresponding path program 5 times [2022-01-19 08:52:28,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:28,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982163595] [2022-01-19 08:52:28,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:28,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:28,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:28,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982163595] [2022-01-19 08:52:28,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982163595] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:28,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579369742] [2022-01-19 08:52:28,386 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 08:52:28,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:52:28,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:52:28,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:52:28,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 08:52:28,458 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 08:52:28,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:52:28,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 08:52:28,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:52:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:28,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:52:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:28,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579369742] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:28,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 08:52:28,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2022-01-19 08:52:28,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984907526] [2022-01-19 08:52:28,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:28,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:52:28,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:52:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-01-19 08:52:28,998 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 08:52:28,998 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) [2022-01-19 08:52:28,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:28,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 08:52:28,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:29,389 INFO L129 PetriNetUnfolder]: 1279/3099 cut-off events. [2022-01-19 08:52:29,389 INFO L130 PetriNetUnfolder]: For 7636/8046 co-relation queries the response was YES. [2022-01-19 08:52:29,397 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. [2022-01-19 08:52:29,409 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 92 selfloop transitions, 21 changer transitions 7/200 dead transitions. [2022-01-19 08:52:29,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 200 transitions, 1305 flow [2022-01-19 08:52:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 08:52:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 08:52:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 993 transitions. [2022-01-19 08:52:29,411 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7580152671755725 [2022-01-19 08:52:29,411 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 993 transitions. [2022-01-19 08:52:29,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 993 transitions. [2022-01-19 08:52:29,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:29,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 993 transitions. [2022-01-19 08:52:29,413 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) [2022-01-19 08:52:29,414 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) [2022-01-19 08:52:29,415 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) [2022-01-19 08:52:29,415 INFO L186 Difference]: Start difference. First operand has 149 places, 143 transitions, 684 flow. Second operand 10 states and 993 transitions. [2022-01-19 08:52:29,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 200 transitions, 1305 flow [2022-01-19 08:52:29,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 200 transitions, 1287 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-01-19 08:52:29,422 INFO L242 Difference]: Finished difference. Result has 154 places, 147 transitions, 784 flow [2022-01-19 08:52:29,423 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} [2022-01-19 08:52:29,423 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2022-01-19 08:52:29,424 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 784 flow [2022-01-19 08:52:29,425 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) [2022-01-19 08:52:29,425 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:29,425 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] [2022-01-19 08:52:29,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 08:52:29,639 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 [2022-01-19 08:52:29,640 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)] === [2022-01-19 08:52:29,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:29,640 INFO L85 PathProgramCache]: Analyzing trace with hash -741365418, now seen corresponding path program 1 times [2022-01-19 08:52:29,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:29,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242626961] [2022-01-19 08:52:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:29,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:29,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:29,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242626961] [2022-01-19 08:52:29,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242626961] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:29,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363804552] [2022-01-19 08:52:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:29,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:52:29,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:52:29,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:52:29,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 08:52:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:29,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 08:52:29,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:52:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:29,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:52:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:30,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363804552] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:52:30,107 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:52:30,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2022-01-19 08:52:30,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564166216] [2022-01-19 08:52:30,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:52:30,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 08:52:30,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:30,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 08:52:30,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-19 08:52:30,108 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2022-01-19 08:52:30,109 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) [2022-01-19 08:52:30,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:30,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2022-01-19 08:52:30,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:31,224 INFO L129 PetriNetUnfolder]: 6226/11076 cut-off events. [2022-01-19 08:52:31,225 INFO L130 PetriNetUnfolder]: For 41315/41315 co-relation queries the response was YES. [2022-01-19 08:52:31,266 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. [2022-01-19 08:52:31,314 INFO L132 encePairwiseOnDemand]: 115/131 looper letters, 177 selfloop transitions, 55 changer transitions 21/320 dead transitions. [2022-01-19 08:52:31,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 320 transitions, 2270 flow [2022-01-19 08:52:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 08:52:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 08:52:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1787 transitions. [2022-01-19 08:52:31,317 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7179590196866211 [2022-01-19 08:52:31,317 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1787 transitions. [2022-01-19 08:52:31,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1787 transitions. [2022-01-19 08:52:31,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:31,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1787 transitions. [2022-01-19 08:52:31,321 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) [2022-01-19 08:52:31,323 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) [2022-01-19 08:52:31,323 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) [2022-01-19 08:52:31,324 INFO L186 Difference]: Start difference. First operand has 154 places, 147 transitions, 784 flow. Second operand 19 states and 1787 transitions. [2022-01-19 08:52:31,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 320 transitions, 2270 flow [2022-01-19 08:52:31,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 320 transitions, 2233 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-01-19 08:52:31,346 INFO L242 Difference]: Finished difference. Result has 178 places, 171 transitions, 1207 flow [2022-01-19 08:52:31,347 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} [2022-01-19 08:52:31,347 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2022-01-19 08:52:31,348 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 171 transitions, 1207 flow [2022-01-19 08:52:31,348 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) [2022-01-19 08:52:31,348 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:31,348 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] [2022-01-19 08:52:31,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 08:52:31,564 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 [2022-01-19 08:52:31,564 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)] === [2022-01-19 08:52:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash 432141502, now seen corresponding path program 1 times [2022-01-19 08:52:31,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:31,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205113195] [2022-01-19 08:52:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:31,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:31,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:31,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205113195] [2022-01-19 08:52:31,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205113195] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:31,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104753444] [2022-01-19 08:52:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:31,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:52:31,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:52:31,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:52:31,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 08:52:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:31,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 08:52:31,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:52:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:52:32,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:52:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:52:32,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104753444] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:32,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 08:52:32,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2022-01-19 08:52:32,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111285109] [2022-01-19 08:52:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:32,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:52:32,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:32,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:52:32,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-01-19 08:52:32,381 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 08:52:32,382 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) [2022-01-19 08:52:32,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:32,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 08:52:32,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:33,077 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)]) [2022-01-19 08:52:33,077 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 08:52:33,077 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:33,077 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:33,077 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:33,120 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)]) [2022-01-19 08:52:33,120 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 08:52:33,120 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:33,120 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:33,120 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:33,145 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)]) [2022-01-19 08:52:33,146 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 08:52:33,146 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:33,146 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,146 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,147 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)]) [2022-01-19 08:52:33,147 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 08:52:33,147 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:33,147 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,147 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,188 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)]) [2022-01-19 08:52:33,188 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 08:52:33,188 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:33,189 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:33,189 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:33,190 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)]) [2022-01-19 08:52:33,190 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 08:52:33,190 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:33,190 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:33,190 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:33,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[][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)]) [2022-01-19 08:52:33,238 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 08:52:33,238 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,238 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,238 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,239 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)]) [2022-01-19 08:52:33,239 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 08:52:33,239 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,239 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,239 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:33,288 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)]) [2022-01-19 08:52:33,288 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 08:52:33,288 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 08:52:33,288 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:33,288 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:33,698 INFO L129 PetriNetUnfolder]: 5683/11760 cut-off events. [2022-01-19 08:52:33,698 INFO L130 PetriNetUnfolder]: For 88476/89679 co-relation queries the response was YES. [2022-01-19 08:52:33,757 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. [2022-01-19 08:52:33,828 INFO L132 encePairwiseOnDemand]: 120/131 looper letters, 200 selfloop transitions, 25 changer transitions 2/308 dead transitions. [2022-01-19 08:52:33,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 308 transitions, 3138 flow [2022-01-19 08:52:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 08:52:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 08:52:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 996 transitions. [2022-01-19 08:52:33,830 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7603053435114504 [2022-01-19 08:52:33,830 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 996 transitions. [2022-01-19 08:52:33,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 996 transitions. [2022-01-19 08:52:33,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:33,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 996 transitions. [2022-01-19 08:52:33,832 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) [2022-01-19 08:52:33,833 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) [2022-01-19 08:52:33,834 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) [2022-01-19 08:52:33,834 INFO L186 Difference]: Start difference. First operand has 178 places, 171 transitions, 1207 flow. Second operand 10 states and 996 transitions. [2022-01-19 08:52:33,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 308 transitions, 3138 flow [2022-01-19 08:52:33,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 308 transitions, 2847 flow, removed 85 selfloop flow, removed 14 redundant places. [2022-01-19 08:52:33,925 INFO L242 Difference]: Finished difference. Result has 171 places, 182 transitions, 1283 flow [2022-01-19 08:52:33,925 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} [2022-01-19 08:52:33,926 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 54 predicate places. [2022-01-19 08:52:33,926 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 182 transitions, 1283 flow [2022-01-19 08:52:33,926 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) [2022-01-19 08:52:33,926 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:33,926 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] [2022-01-19 08:52:33,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 08:52:34,139 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 [2022-01-19 08:52:34,139 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)] === [2022-01-19 08:52:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash -687977584, now seen corresponding path program 2 times [2022-01-19 08:52:34,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:34,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182541632] [2022-01-19 08:52:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:34,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:34,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:34,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182541632] [2022-01-19 08:52:34,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182541632] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:34,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879676831] [2022-01-19 08:52:34,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 08:52:34,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:52:34,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:52:34,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:52:34,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 08:52:34,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 08:52:34,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:52:34,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 08:52:34,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:52:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:34,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:52:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:35,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879676831] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:52:35,076 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:52:35,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-01-19 08:52:35,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413314444] [2022-01-19 08:52:35,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:52:35,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 08:52:35,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:35,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 08:52:35,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-01-19 08:52:35,081 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 08:52:35,082 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) [2022-01-19 08:52:35,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:35,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 08:52:35,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:40,468 INFO L129 PetriNetUnfolder]: 26368/50183 cut-off events. [2022-01-19 08:52:40,469 INFO L130 PetriNetUnfolder]: For 298653/298811 co-relation queries the response was YES. [2022-01-19 08:52:40,744 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. [2022-01-19 08:52:40,978 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 558 selfloop transitions, 95 changer transitions 12/733 dead transitions. [2022-01-19 08:52:40,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 733 transitions, 8145 flow [2022-01-19 08:52:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-19 08:52:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-19 08:52:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2482 transitions. [2022-01-19 08:52:40,981 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7287140340575455 [2022-01-19 08:52:40,981 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2482 transitions. [2022-01-19 08:52:40,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2482 transitions. [2022-01-19 08:52:40,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:40,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2482 transitions. [2022-01-19 08:52:40,985 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) [2022-01-19 08:52:40,988 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) [2022-01-19 08:52:40,989 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) [2022-01-19 08:52:40,989 INFO L186 Difference]: Start difference. First operand has 171 places, 182 transitions, 1283 flow. Second operand 26 states and 2482 transitions. [2022-01-19 08:52:40,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 733 transitions, 8145 flow [2022-01-19 08:52:41,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 733 transitions, 7878 flow, removed 130 selfloop flow, removed 4 redundant places. [2022-01-19 08:52:41,284 INFO L242 Difference]: Finished difference. Result has 208 places, 245 transitions, 2344 flow [2022-01-19 08:52:41,284 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} [2022-01-19 08:52:41,285 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 91 predicate places. [2022-01-19 08:52:41,285 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 245 transitions, 2344 flow [2022-01-19 08:52:41,286 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) [2022-01-19 08:52:41,286 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:41,286 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] [2022-01-19 08:52:41,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 08:52:41,487 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 [2022-01-19 08:52:41,488 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)] === [2022-01-19 08:52:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:41,488 INFO L85 PathProgramCache]: Analyzing trace with hash 982740406, now seen corresponding path program 3 times [2022-01-19 08:52:41,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:41,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783365030] [2022-01-19 08:52:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:41,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:41,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:41,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783365030] [2022-01-19 08:52:41,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783365030] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:41,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127822123] [2022-01-19 08:52:41,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 08:52:41,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:52:41,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:52:41,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:52:41,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 08:52:41,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 08:52:41,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:52:41,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 08:52:41,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:52:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 08:52:42,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 08:52:42,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127822123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:42,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 08:52:42,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-01-19 08:52:42,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067358236] [2022-01-19 08:52:42,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:42,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:52:42,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:52:42,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-01-19 08:52:42,149 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 08:52:42,150 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) [2022-01-19 08:52:42,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:42,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 08:52:42,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:45,356 INFO L129 PetriNetUnfolder]: 10650/26189 cut-off events. [2022-01-19 08:52:45,356 INFO L130 PetriNetUnfolder]: For 313006/316351 co-relation queries the response was YES. [2022-01-19 08:52:45,697 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. [2022-01-19 08:52:45,821 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 156 selfloop transitions, 25 changer transitions 3/270 dead transitions. [2022-01-19 08:52:45,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 270 transitions, 3063 flow [2022-01-19 08:52:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 08:52:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 08:52:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2022-01-19 08:52:45,822 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7351145038167939 [2022-01-19 08:52:45,822 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2022-01-19 08:52:45,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2022-01-19 08:52:45,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:45,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2022-01-19 08:52:45,824 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) [2022-01-19 08:52:45,825 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) [2022-01-19 08:52:45,825 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) [2022-01-19 08:52:45,825 INFO L186 Difference]: Start difference. First operand has 208 places, 245 transitions, 2344 flow. Second operand 10 states and 963 transitions. [2022-01-19 08:52:45,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 270 transitions, 3063 flow [2022-01-19 08:52:46,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 270 transitions, 2842 flow, removed 84 selfloop flow, removed 9 redundant places. [2022-01-19 08:52:46,113 INFO L242 Difference]: Finished difference. Result has 204 places, 237 transitions, 2103 flow [2022-01-19 08:52:46,114 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} [2022-01-19 08:52:46,114 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 87 predicate places. [2022-01-19 08:52:46,114 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 237 transitions, 2103 flow [2022-01-19 08:52:46,115 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) [2022-01-19 08:52:46,115 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:46,115 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] [2022-01-19 08:52:46,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 08:52:46,316 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 [2022-01-19 08:52:46,317 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)] === [2022-01-19 08:52:46,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash 822271266, now seen corresponding path program 2 times [2022-01-19 08:52:46,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:46,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645215838] [2022-01-19 08:52:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:46,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:52:46,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:46,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645215838] [2022-01-19 08:52:46,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645215838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:52:46,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:52:46,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:52:46,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036752568] [2022-01-19 08:52:46,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:52:46,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:52:46,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:52:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:52:46,410 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 08:52:46,411 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) [2022-01-19 08:52:46,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:46,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 08:52:46,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:51,165 INFO L129 PetriNetUnfolder]: 22812/40363 cut-off events. [2022-01-19 08:52:51,166 INFO L130 PetriNetUnfolder]: For 413664/413703 co-relation queries the response was YES. [2022-01-19 08:52:51,506 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. [2022-01-19 08:52:51,729 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 169 selfloop transitions, 28 changer transitions 15/280 dead transitions. [2022-01-19 08:52:51,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 280 transitions, 3030 flow [2022-01-19 08:52:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 08:52:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 08:52:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 910 transitions. [2022-01-19 08:52:51,731 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6946564885496184 [2022-01-19 08:52:51,731 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 910 transitions. [2022-01-19 08:52:51,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 910 transitions. [2022-01-19 08:52:51,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:51,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 910 transitions. [2022-01-19 08:52:51,732 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) [2022-01-19 08:52:51,733 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) [2022-01-19 08:52:51,733 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) [2022-01-19 08:52:51,734 INFO L186 Difference]: Start difference. First operand has 204 places, 237 transitions, 2103 flow. Second operand 10 states and 910 transitions. [2022-01-19 08:52:51,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 280 transitions, 3030 flow [2022-01-19 08:52:52,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 280 transitions, 2949 flow, removed 8 selfloop flow, removed 12 redundant places. [2022-01-19 08:52:52,247 INFO L242 Difference]: Finished difference. Result has 200 places, 239 transitions, 2166 flow [2022-01-19 08:52:52,247 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} [2022-01-19 08:52:52,247 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 83 predicate places. [2022-01-19 08:52:52,247 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 239 transitions, 2166 flow [2022-01-19 08:52:52,248 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) [2022-01-19 08:52:52,248 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:52,248 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] [2022-01-19 08:52:52,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 08:52:52,248 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)] === [2022-01-19 08:52:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1431070086, now seen corresponding path program 1 times [2022-01-19 08:52:52,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:52,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053811852] [2022-01-19 08:52:52,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:52,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:52:52,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:52,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053811852] [2022-01-19 08:52:52,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053811852] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:52,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008367774] [2022-01-19 08:52:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:52,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:52:52,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:52:52,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:52:52,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 08:52:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:52,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 08:52:52,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:52:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:52:52,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:52:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:52:52,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008367774] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:52:52,949 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:52:52,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-01-19 08:52:52,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627306746] [2022-01-19 08:52:52,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:52:52,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 08:52:52,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:52,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 08:52:52,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 08:52:52,951 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2022-01-19 08:52:52,951 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) [2022-01-19 08:52:52,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:52,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2022-01-19 08:52:52,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:52:53,279 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))))]) [2022-01-19 08:52:53,279 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-01-19 08:52:53,279 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 08:52:53,279 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 08:52:53,279 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-01-19 08:52:53,290 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)]) [2022-01-19 08:52:53,290 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-01-19 08:52:53,291 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 08:52:53,291 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-01-19 08:52:53,291 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 08:52:53,657 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))))]) [2022-01-19 08:52:53,657 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 08:52:53,657 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 08:52:53,657 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 08:52:53,657 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 08:52:53,660 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))))]) [2022-01-19 08:52:53,660 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-01-19 08:52:53,660 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:53,660 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:53,660 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:53,879 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)]) [2022-01-19 08:52:53,879 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-01-19 08:52:53,879 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:53,879 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:53,879 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:53,924 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))))]) [2022-01-19 08:52:53,924 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-01-19 08:52:53,924 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-01-19 08:52:53,924 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-01-19 08:52:53,924 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-01-19 08:52:54,078 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))))]) [2022-01-19 08:52:54,079 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,079 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,079 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:54,079 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:54,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][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))))]) [2022-01-19 08:52:54,129 INFO L384 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-01-19 08:52:54,129 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-01-19 08:52:54,129 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-01-19 08:52:54,129 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-01-19 08:52:54,192 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))))]) [2022-01-19 08:52:54,192 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,192 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:54,192 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:54,192 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:54,229 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))))]) [2022-01-19 08:52:54,229 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,229 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,229 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 08:52:54,229 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 08:52:54,286 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))))]) [2022-01-19 08:52:54,286 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,286 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,286 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 08:52:54,286 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 08:52:54,286 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))))]) [2022-01-19 08:52:54,286 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,286 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 08:52:54,286 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 08:52:54,286 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,315 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))))]) [2022-01-19 08:52:54,315 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,315 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:54,315 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,315 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:54,326 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))))]) [2022-01-19 08:52:54,326 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,326 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:54,326 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:54,326 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:54,345 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))))]) [2022-01-19 08:52:54,345 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,345 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,345 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,345 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,353 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))))]) [2022-01-19 08:52:54,353 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,353 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,353 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,353 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:54,797 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))))]) [2022-01-19 08:52:54,797 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,797 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,797 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,797 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,813 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))))]) [2022-01-19 08:52:54,813 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,813 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,813 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,813 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,813 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))))]) [2022-01-19 08:52:54,813 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,813 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,814 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,814 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,819 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))))]) [2022-01-19 08:52:54,820 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,820 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 08:52:54,820 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 08:52:54,820 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,820 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:54,821 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))))]) [2022-01-19 08:52:54,821 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,821 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,821 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,821 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,920 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))))]) [2022-01-19 08:52:54,920 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-01-19 08:52:54,920 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-01-19 08:52:54,920 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-01-19 08:52:54,920 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-01-19 08:52:54,921 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))))]) [2022-01-19 08:52:54,921 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,921 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,921 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,921 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:54,921 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,002 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))))]) [2022-01-19 08:52:55,002 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,002 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,002 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,002 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,103 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))))]) [2022-01-19 08:52:55,103 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,103 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,103 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,103 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,103 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))))]) [2022-01-19 08:52:55,104 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,104 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:55,104 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,104 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:55,104 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 08:52:55,245 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))))]) [2022-01-19 08:52:55,245 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 08:52:55,245 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:55,245 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:55,245 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:55,348 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))))]) [2022-01-19 08:52:55,349 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 08:52:55,349 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:55,349 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 08:52:55,349 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 08:52:55,355 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))))]) [2022-01-19 08:52:55,356 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 08:52:55,356 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:55,356 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 08:52:55,356 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:55,692 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))))]) [2022-01-19 08:52:55,692 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 08:52:55,692 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,693 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,693 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,704 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))))]) [2022-01-19 08:52:55,705 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 08:52:55,705 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:55,705 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:55,705 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 08:52:55,705 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))))]) [2022-01-19 08:52:55,705 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 08:52:55,705 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:55,705 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 08:52:55,705 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 08:52:55,871 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))))]) [2022-01-19 08:52:55,871 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 08:52:55,871 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,871 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,871 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:55,967 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))))]) [2022-01-19 08:52:55,967 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,967 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,967 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,967 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,977 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]) [2022-01-19 08:52:55,977 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,977 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,978 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,978 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,983 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))))]) [2022-01-19 08:52:55,983 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,984 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:55,984 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:55,984 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:55,984 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))))]) [2022-01-19 08:52:55,985 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 08:52:55,985 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:55,985 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:55,985 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 08:52:56,149 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))))]) [2022-01-19 08:52:56,149 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 08:52:56,149 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,150 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,150 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 08:52:56,191 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))))]) [2022-01-19 08:52:56,192 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 08:52:56,192 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,192 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,192 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,192 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))))]) [2022-01-19 08:52:56,192 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 08:52:56,193 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,193 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,193 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,193 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,193 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 08:52:56,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], [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)]) [2022-01-19 08:52:56,197 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 08:52:56,197 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 08:52:56,198 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 08:52:56,198 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 08:52:56,318 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))))]) [2022-01-19 08:52:56,318 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-19 08:52:56,319 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 08:52:56,319 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 08:52:56,319 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 08:52:56,394 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)]) [2022-01-19 08:52:56,394 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-01-19 08:52:56,394 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 08:52:56,394 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 08:52:56,394 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 08:52:56,569 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))))]) [2022-01-19 08:52:56,569 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-19 08:52:56,569 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 08:52:56,569 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 08:52:56,569 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 08:52:56,570 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))))]) [2022-01-19 08:52:56,570 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-19 08:52:56,570 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 08:52:56,570 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 08:52:56,570 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 08:52:56,898 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))))]) [2022-01-19 08:52:56,898 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-01-19 08:52:56,898 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 08:52:56,899 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 08:52:56,899 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 08:52:57,094 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)]) [2022-01-19 08:52:57,094 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 08:52:57,094 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 08:52:57,094 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 08:52:57,094 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 08:52:57,171 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: 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: 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)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, 137#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 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)))), 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), 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)), 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)]) [2022-01-19 08:52:57,171 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 08:52:57,171 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 08:52:57,171 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 08:52:57,171 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 08:52:57,172 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: 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: 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)), 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)), 1200#true, 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: 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))))]) [2022-01-19 08:52:57,172 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 08:52:57,172 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 08:52:57,172 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 08:52:57,172 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 08:52:57,237 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: 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)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, 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, 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)), 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: 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: 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)]) [2022-01-19 08:52:57,237 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,237 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,237 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,237 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,238 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)), 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)), 94#L100-2true, 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))))]) [2022-01-19 08:52:57,238 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,238 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 08:52:57,238 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 08:52:57,238 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,327 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, 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, 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)), 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), 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: 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: 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)]) [2022-01-19 08:52:57,328 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 08:52:57,328 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,328 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 08:52:57,328 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,382 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: 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: 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)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, 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, 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), 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)), 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)))), Black: 1248#(= ~counter~0 0)]) [2022-01-19 08:52:57,382 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-01-19 08:52:57,382 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,382 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,382 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 08:52:57,565 INFO L129 PetriNetUnfolder]: 13872/37203 cut-off events. [2022-01-19 08:52:57,566 INFO L130 PetriNetUnfolder]: For 536006/543256 co-relation queries the response was YES. [2022-01-19 08:52:58,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193962 conditions, 37203 events. 13872/37203 cut-off events. For 536006/543256 co-relation queries the response was YES. Maximal size of possible extension queue 2598. Compared 476663 event pairs, 3343 based on Foata normal form. 1896/36845 useless extension candidates. Maximal degree in co-relation 193917. Up to 8464 conditions per place. [2022-01-19 08:52:58,288 INFO L132 encePairwiseOnDemand]: 123/131 looper letters, 79 selfloop transitions, 147 changer transitions 4/354 dead transitions. [2022-01-19 08:52:58,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 354 transitions, 4045 flow [2022-01-19 08:52:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 08:52:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 08:52:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2022-01-19 08:52:58,290 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8429661941112323 [2022-01-19 08:52:58,290 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2022-01-19 08:52:58,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2022-01-19 08:52:58,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:52:58,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2022-01-19 08:52:58,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:52:58,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:52:58,292 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:52:58,292 INFO L186 Difference]: Start difference. First operand has 200 places, 239 transitions, 2166 flow. Second operand 7 states and 773 transitions. [2022-01-19 08:52:58,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 354 transitions, 4045 flow [2022-01-19 08:52:58,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 354 transitions, 3984 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-01-19 08:52:58,789 INFO L242 Difference]: Finished difference. Result has 201 places, 322 transitions, 3950 flow [2022-01-19 08:52:58,790 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3950, PETRI_PLACES=201, PETRI_TRANSITIONS=322} [2022-01-19 08:52:58,790 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 84 predicate places. [2022-01-19 08:52:58,790 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 322 transitions, 3950 flow [2022-01-19 08:52:58,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-01-19 08:52:58,791 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:52:58,791 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, 1, 1, 1, 1] [2022-01-19 08:52:58,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 08:52:58,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:52:58,992 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:52:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:52:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash -670284878, now seen corresponding path program 2 times [2022-01-19 08:52:58,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:52:58,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388957481] [2022-01-19 08:52:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:52:58,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:52:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:52:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:52:59,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:52:59,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388957481] [2022-01-19 08:52:59,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388957481] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:52:59,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581071070] [2022-01-19 08:52:59,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 08:52:59,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:52:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:52:59,131 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:52:59,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 08:52:59,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 08:52:59,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:52:59,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 08:52:59,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:52:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:52:59,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:52:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:52:59,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581071070] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:52:59,862 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:52:59,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-01-19 08:52:59,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109447157] [2022-01-19 08:52:59,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:52:59,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 08:52:59,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:52:59,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 08:52:59,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2022-01-19 08:52:59,865 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2022-01-19 08:52:59,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 322 transitions, 3950 flow. Second operand has 25 states, 25 states have (on average 86.76) internal successors, (2169), 25 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:52:59,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:52:59,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2022-01-19 08:52:59,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:53:15,639 INFO L129 PetriNetUnfolder]: 60760/110335 cut-off events. [2022-01-19 08:53:15,639 INFO L130 PetriNetUnfolder]: For 1346340/1346441 co-relation queries the response was YES. [2022-01-19 08:53:16,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 594762 conditions, 110335 events. 60760/110335 cut-off events. For 1346340/1346441 co-relation queries the response was YES. Maximal size of possible extension queue 6642. Compared 1202814 event pairs, 7487 based on Foata normal form. 4454/113719 useless extension candidates. Maximal degree in co-relation 594714. Up to 17344 conditions per place. [2022-01-19 08:53:17,317 INFO L132 encePairwiseOnDemand]: 114/131 looper letters, 956 selfloop transitions, 586 changer transitions 0/1609 dead transitions. [2022-01-19 08:53:17,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1609 transitions, 25483 flow [2022-01-19 08:53:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 08:53:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 08:53:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 5429 transitions. [2022-01-19 08:53:17,321 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7145301395103975 [2022-01-19 08:53:17,321 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 5429 transitions. [2022-01-19 08:53:17,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 5429 transitions. [2022-01-19 08:53:17,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:53:17,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 5429 transitions. [2022-01-19 08:53:17,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 93.60344827586206) internal successors, (5429), 58 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:53:17,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 131.0) internal successors, (7729), 59 states have internal predecessors, (7729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:53:17,335 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 131.0) internal successors, (7729), 59 states have internal predecessors, (7729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:53:17,336 INFO L186 Difference]: Start difference. First operand has 201 places, 322 transitions, 3950 flow. Second operand 58 states and 5429 transitions. [2022-01-19 08:53:17,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1609 transitions, 25483 flow [2022-01-19 08:53:21,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 1609 transitions, 23237 flow, removed 1105 selfloop flow, removed 3 redundant places. [2022-01-19 08:53:21,941 INFO L242 Difference]: Finished difference. Result has 290 places, 751 transitions, 11492 flow [2022-01-19 08:53:21,941 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=3614, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=11492, PETRI_PLACES=290, PETRI_TRANSITIONS=751} [2022-01-19 08:53:21,941 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 173 predicate places. [2022-01-19 08:53:21,941 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 751 transitions, 11492 flow [2022-01-19 08:53:21,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 86.76) internal successors, (2169), 25 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:53:21,942 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:53:21,942 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, 1, 1, 1, 1] [2022-01-19 08:53:21,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 08:53:22,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-19 08:53:22,143 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:53:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:53:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1537742894, now seen corresponding path program 3 times [2022-01-19 08:53:22,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:53:22,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593149367] [2022-01-19 08:53:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:53:22,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:53:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:53:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:53:22,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:53:22,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593149367] [2022-01-19 08:53:22,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593149367] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:53:22,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447528882] [2022-01-19 08:53:22,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 08:53:22,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:53:22,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:53:22,256 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:53:22,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 08:53:22,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 08:53:22,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:53:22,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 08:53:22,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:53:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:53:22,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:53:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:53:22,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447528882] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:53:22,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:53:22,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-01-19 08:53:22,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681145465] [2022-01-19 08:53:22,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:53:22,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 08:53:22,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:53:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 08:53:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-01-19 08:53:22,984 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 08:53:22,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 751 transitions, 11492 flow. Second operand has 24 states, 24 states have (on average 87.79166666666667) internal successors, (2107), 24 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:53:22,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:53:22,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 08:53:22,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:54:04,870 INFO L129 PetriNetUnfolder]: 97298/182625 cut-off events. [2022-01-19 08:54:04,871 INFO L130 PetriNetUnfolder]: For 6436872/6436969 co-relation queries the response was YES. [2022-01-19 08:54:07,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1386155 conditions, 182625 events. 97298/182625 cut-off events. For 6436872/6436969 co-relation queries the response was YES. Maximal size of possible extension queue 12252. Compared 2211409 event pairs, 18832 based on Foata normal form. 3550/183955 useless extension candidates. Maximal degree in co-relation 1386072. Up to 44095 conditions per place. [2022-01-19 08:54:09,165 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 1416 selfloop transitions, 590 changer transitions 98/2172 dead transitions. [2022-01-19 08:54:09,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 2172 transitions, 39798 flow [2022-01-19 08:54:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-19 08:54:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-01-19 08:54:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2175 transitions. [2022-01-19 08:54:09,167 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7218718884832392 [2022-01-19 08:54:09,167 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2175 transitions. [2022-01-19 08:54:09,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2175 transitions. [2022-01-19 08:54:09,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:54:09,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2175 transitions. [2022-01-19 08:54:09,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 94.56521739130434) internal successors, (2175), 23 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:54:09,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 131.0) internal successors, (3144), 24 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:54:09,172 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 131.0) internal successors, (3144), 24 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:54:09,172 INFO L186 Difference]: Start difference. First operand has 290 places, 751 transitions, 11492 flow. Second operand 23 states and 2175 transitions. [2022-01-19 08:54:09,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 2172 transitions, 39798 flow [2022-01-19 08:55:32,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 2172 transitions, 37003 flow, removed 1121 selfloop flow, removed 16 redundant places. [2022-01-19 08:55:32,601 INFO L242 Difference]: Finished difference. Result has 307 places, 1213 transitions, 20047 flow [2022-01-19 08:55:32,602 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=10387, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=20047, PETRI_PLACES=307, PETRI_TRANSITIONS=1213} [2022-01-19 08:55:32,602 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 190 predicate places. [2022-01-19 08:55:32,602 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 1213 transitions, 20047 flow [2022-01-19 08:55:32,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 87.79166666666667) internal successors, (2107), 24 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:55:32,603 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:55:32,605 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, 1, 1, 1, 1] [2022-01-19 08:55:32,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 08:55:32,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-19 08:55:32,820 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:55:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:55:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash 160369916, now seen corresponding path program 4 times [2022-01-19 08:55:32,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:55:32,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926729411] [2022-01-19 08:55:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:55:32,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:55:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:55:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:55:32,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:55:32,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926729411] [2022-01-19 08:55:32,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926729411] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:55:32,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596789830] [2022-01-19 08:55:32,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 08:55:32,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:55:32,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:55:32,932 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:55:32,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 08:55:33,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 08:55:33,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:55:33,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 08:55:33,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:55:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:55:33,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:55:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:55:33,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596789830] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:55:33,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:55:33,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-01-19 08:55:33,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603181624] [2022-01-19 08:55:33,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:55:33,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 08:55:33,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:55:33,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 08:55:33,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-19 08:55:33,669 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2022-01-19 08:55:33,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 1213 transitions, 20047 flow. Second operand has 25 states, 25 states have (on average 86.72) internal successors, (2168), 25 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:55:33,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:55:33,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2022-01-19 08:55:33,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand