./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec11f673f0852354e1b011c47ea1690182c02849435cfe6b9232c63dc6ffceb8 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:35:23,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:35:23,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:35:23,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:35:23,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:35:23,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:35:23,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:35:23,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:35:23,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:35:23,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:35:23,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:35:23,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:35:23,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:35:23,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:35:23,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:35:23,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:35:23,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:35:23,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:35:23,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:35:23,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:35:23,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:35:23,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:35:23,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:35:23,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:35:23,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:35:23,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:35:23,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:35:23,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:35:23,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:35:23,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:35:23,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:35:23,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:35:23,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:35:23,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:35:23,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:35:23,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:35:23,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:35:23,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:35:23,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:35:23,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:35:23,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:35:23,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 19:35:23,958 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:35:23,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:35:23,958 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:35:23,958 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:35:23,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:35:23,959 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:35:23,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:35:23,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:35:23,959 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:35:23,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:35:23,960 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:35:23,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:35:23,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:35:23,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:35:23,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 19:35:23,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:35:23,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 19:35:23,960 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:35:23,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 19:35:23,961 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:35:23,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 19:35:23,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:35:23,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:35:23,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:35:23,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:35:23,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:35:23,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:35:23,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 19:35:23,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:35:23,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:35:23,962 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 19:35:23,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 19:35:23,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 19:35:23,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:35:23,962 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec11f673f0852354e1b011c47ea1690182c02849435cfe6b9232c63dc6ffceb8 [2021-12-06 19:35:24,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:35:24,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:35:24,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:35:24,174 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:35:24,175 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:35:24,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2021-12-06 19:35:24,217 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/data/c1d14ba20/707f2a28f8d54f10bab769e513ae5699/FLAG922b26a2c [2021-12-06 19:35:24,594 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:35:24,594 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2021-12-06 19:35:24,599 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/data/c1d14ba20/707f2a28f8d54f10bab769e513ae5699/FLAG922b26a2c [2021-12-06 19:35:24,609 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/data/c1d14ba20/707f2a28f8d54f10bab769e513ae5699 [2021-12-06 19:35:24,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:35:24,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:35:24,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:35:24,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:35:24,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:35:24,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d94f333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24, skipping insertion in model container [2021-12-06 19:35:24,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:35:24,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:35:24,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2021-12-06 19:35:24,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:35:24,761 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:35:24,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2021-12-06 19:35:24,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:35:24,792 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:35:24,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24 WrapperNode [2021-12-06 19:35:24,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:35:24,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:35:24,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:35:24,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:35:24,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,828 INFO L137 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2021-12-06 19:35:24,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:35:24,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:35:24,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:35:24,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:35:24,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:35:24,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:35:24,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:35:24,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:35:24,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (1/1) ... [2021-12-06 19:35:24,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:35:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:35:24,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:35:24,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:35:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:35:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-06 19:35:24,919 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-06 19:35:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-06 19:35:24,919 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-06 19:35:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-06 19:35:24,919 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-06 19:35:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-06 19:35:24,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-06 19:35:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:35:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 19:35:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 19:35:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 19:35:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 19:35:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:35:24,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:35:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 19:35:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 19:35:24,921 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 19:35:24,982 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:35:24,983 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:35:25,149 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:35:25,197 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:35:25,198 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-06 19:35:25,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:35:25 BoogieIcfgContainer [2021-12-06 19:35:25,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:35:25,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:35:25,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:35:25,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:35:25,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:35:24" (1/3) ... [2021-12-06 19:35:25,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476d8a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:35:25, skipping insertion in model container [2021-12-06 19:35:25,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:35:24" (2/3) ... [2021-12-06 19:35:25,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476d8a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:35:25, skipping insertion in model container [2021-12-06 19:35:25,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:35:25" (3/3) ... [2021-12-06 19:35:25,205 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2021-12-06 19:35:25,209 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 19:35:25,210 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:35:25,210 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 19:35:25,210 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 19:35:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,241 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,241 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,241 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,241 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,241 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,243 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,244 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,244 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,244 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,245 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,245 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,246 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,246 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,246 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,246 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,246 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,247 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,247 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,247 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,247 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,247 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 19:35:25,250 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-06 19:35:25,285 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:35:25,290 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 19:35:25,291 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-06 19:35:25,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 131 transitions, 294 flow [2021-12-06 19:35:25,343 INFO L129 PetriNetUnfolder]: 10/127 cut-off events. [2021-12-06 19:35:25,343 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-06 19:35:25,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 127 events. 10/127 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2021-12-06 19:35:25,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 131 transitions, 294 flow [2021-12-06 19:35:25,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 114 transitions, 252 flow [2021-12-06 19:35:25,372 INFO L129 PetriNetUnfolder]: 10/113 cut-off events. [2021-12-06 19:35:25,372 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-06 19:35:25,373 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:25,373 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:25,374 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:25,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:25,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1069838279, now seen corresponding path program 1 times [2021-12-06 19:35:25,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:25,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40879000] [2021-12-06 19:35:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:25,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:25,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:25,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40879000] [2021-12-06 19:35:25,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40879000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:25,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:35:25,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 19:35:25,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687475528] [2021-12-06 19:35:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:25,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 19:35:25,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:25,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 19:35:25,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 19:35:25,593 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 131 [2021-12-06 19:35:25,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 252 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:25,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 131 [2021-12-06 19:35:25,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:25,640 INFO L129 PetriNetUnfolder]: 16/120 cut-off events. [2021-12-06 19:35:25,640 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-12-06 19:35:25,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 120 events. 16/120 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 18/132 useless extension candidates. Maximal degree in co-relation 98. Up to 25 conditions per place. [2021-12-06 19:35:25,642 INFO L132 encePairwiseOnDemand]: 125/131 looper letters, 12 selfloop transitions, 0 changer transitions 2/108 dead transitions. [2021-12-06 19:35:25,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 264 flow [2021-12-06 19:35:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 19:35:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-06 19:35:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2021-12-06 19:35:25,652 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2021-12-06 19:35:25,653 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 242 transitions. [2021-12-06 19:35:25,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 242 transitions. [2021-12-06 19:35:25,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:25,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 242 transitions. [2021-12-06 19:35:25,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 121.0) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,662 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,664 INFO L186 Difference]: Start difference. First operand has 117 places, 114 transitions, 252 flow. Second operand 2 states and 242 transitions. [2021-12-06 19:35:25,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 264 flow [2021-12-06 19:35:25,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 108 transitions, 248 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-06 19:35:25,670 INFO L242 Difference]: Finished difference. Result has 110 places, 106 transitions, 220 flow [2021-12-06 19:35:25,672 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=220, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2021-12-06 19:35:25,675 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -7 predicate places. [2021-12-06 19:35:25,675 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 220 flow [2021-12-06 19:35:25,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,675 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:25,675 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:25,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:35:25,676 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1574494246, now seen corresponding path program 1 times [2021-12-06 19:35:25,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:25,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130334162] [2021-12-06 19:35:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:25,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:25,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:25,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130334162] [2021-12-06 19:35:25,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130334162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:25,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:35:25,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:35:25,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698111382] [2021-12-06 19:35:25,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:25,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:35:25,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:35:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:35:25,843 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2021-12-06 19:35:25,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:25,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2021-12-06 19:35:25,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:25,931 INFO L129 PetriNetUnfolder]: 23/173 cut-off events. [2021-12-06 19:35:25,931 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-12-06 19:35:25,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 173 events. 23/173 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 225 event pairs, 0 based on Foata normal form. 9/174 useless extension candidates. Maximal degree in co-relation 231. Up to 36 conditions per place. [2021-12-06 19:35:25,933 INFO L132 encePairwiseOnDemand]: 123/131 looper letters, 25 selfloop transitions, 3 changer transitions 5/118 dead transitions. [2021-12-06 19:35:25,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 317 flow [2021-12-06 19:35:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:35:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 19:35:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2021-12-06 19:35:25,937 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8259541984732824 [2021-12-06 19:35:25,938 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2021-12-06 19:35:25,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2021-12-06 19:35:25,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:25,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2021-12-06 19:35:25,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,945 INFO L186 Difference]: Start difference. First operand has 110 places, 106 transitions, 220 flow. Second operand 5 states and 541 transitions. [2021-12-06 19:35:25,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 317 flow [2021-12-06 19:35:25,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 118 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 19:35:25,948 INFO L242 Difference]: Finished difference. Result has 115 places, 108 transitions, 247 flow [2021-12-06 19:35:25,949 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2021-12-06 19:35:25,949 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2021-12-06 19:35:25,950 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 247 flow [2021-12-06 19:35:25,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:25,950 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:25,950 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:25,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 19:35:25,951 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:25,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:25,951 INFO L85 PathProgramCache]: Analyzing trace with hash -575216244, now seen corresponding path program 1 times [2021-12-06 19:35:25,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:25,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160625802] [2021-12-06 19:35:25,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:25,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:26,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:26,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160625802] [2021-12-06 19:35:26,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160625802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:26,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:35:26,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 19:35:26,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097540547] [2021-12-06 19:35:26,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:26,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:35:26,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:35:26,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:35:26,171 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-06 19:35:26,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 247 flow. Second operand has 9 states, 9 states have (on average 87.55555555555556) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:26,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:26,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-06 19:35:26,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:26,689 INFO L129 PetriNetUnfolder]: 2030/3464 cut-off events. [2021-12-06 19:35:26,690 INFO L130 PetriNetUnfolder]: For 591/703 co-relation queries the response was YES. [2021-12-06 19:35:26,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7351 conditions, 3464 events. 2030/3464 cut-off events. For 591/703 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20192 event pairs, 486 based on Foata normal form. 0/2481 useless extension candidates. Maximal degree in co-relation 7344. Up to 782 conditions per place. [2021-12-06 19:35:26,733 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 107 selfloop transitions, 12 changer transitions 0/187 dead transitions. [2021-12-06 19:35:26,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 187 transitions, 714 flow [2021-12-06 19:35:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 19:35:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 19:35:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 874 transitions. [2021-12-06 19:35:26,737 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741306191687871 [2021-12-06 19:35:26,737 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 874 transitions. [2021-12-06 19:35:26,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 874 transitions. [2021-12-06 19:35:26,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:26,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 874 transitions. [2021-12-06 19:35:26,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.11111111111111) internal successors, (874), 9 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:26,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:26,743 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:26,743 INFO L186 Difference]: Start difference. First operand has 115 places, 108 transitions, 247 flow. Second operand 9 states and 874 transitions. [2021-12-06 19:35:26,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 187 transitions, 714 flow [2021-12-06 19:35:26,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 187 transitions, 694 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-12-06 19:35:26,749 INFO L242 Difference]: Finished difference. Result has 122 places, 114 transitions, 315 flow [2021-12-06 19:35:26,749 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=315, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2021-12-06 19:35:26,750 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2021-12-06 19:35:26,750 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 315 flow [2021-12-06 19:35:26,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.55555555555556) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:26,750 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:26,751 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:26,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 19:35:26,751 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1075191398, now seen corresponding path program 2 times [2021-12-06 19:35:26,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:26,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184987005] [2021-12-06 19:35:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:26,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:26,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184987005] [2021-12-06 19:35:26,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184987005] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:35:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176781398] [2021-12-06 19:35:26,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:35:26,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:35:26,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:35:26,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:35:26,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:35:26,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:35:26,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 19:35:26,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:35:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:27,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:35:27,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176781398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:27,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:35:27,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2021-12-06 19:35:27,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112547702] [2021-12-06 19:35:27,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:27,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:35:27,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:35:27,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-12-06 19:35:27,375 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2021-12-06 19:35:27,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 315 flow. Second operand has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:27,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:27,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2021-12-06 19:35:27,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:27,605 INFO L129 PetriNetUnfolder]: 319/720 cut-off events. [2021-12-06 19:35:27,605 INFO L130 PetriNetUnfolder]: For 450/462 co-relation queries the response was YES. [2021-12-06 19:35:27,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 720 events. 319/720 cut-off events. For 450/462 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3038 event pairs, 66 based on Foata normal form. 5/644 useless extension candidates. Maximal degree in co-relation 1777. Up to 233 conditions per place. [2021-12-06 19:35:27,611 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 50 selfloop transitions, 12 changer transitions 0/138 dead transitions. [2021-12-06 19:35:27,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 138 transitions, 522 flow [2021-12-06 19:35:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:35:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:35:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 975 transitions. [2021-12-06 19:35:27,615 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7442748091603053 [2021-12-06 19:35:27,615 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 975 transitions. [2021-12-06 19:35:27,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 975 transitions. [2021-12-06 19:35:27,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:27,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 975 transitions. [2021-12-06 19:35:27,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.5) internal successors, (975), 10 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:27,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:27,621 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:27,621 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 315 flow. Second operand 10 states and 975 transitions. [2021-12-06 19:35:27,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 138 transitions, 522 flow [2021-12-06 19:35:27,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 513 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 19:35:27,626 INFO L242 Difference]: Finished difference. Result has 130 places, 117 transitions, 357 flow [2021-12-06 19:35:27,626 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=357, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2021-12-06 19:35:27,626 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 13 predicate places. [2021-12-06 19:35:27,627 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 357 flow [2021-12-06 19:35:27,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:27,627 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:27,627 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:27,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:35:27,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:27,828 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash -956916982, now seen corresponding path program 1 times [2021-12-06 19:35:27,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:27,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104841186] [2021-12-06 19:35:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:27,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:27,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:27,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104841186] [2021-12-06 19:35:27,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104841186] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:27,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:35:27,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:35:27,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291419245] [2021-12-06 19:35:27,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:27,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:35:27,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:35:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:35:27,950 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-06 19:35:27,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 357 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:27,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:27,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-06 19:35:27,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:28,458 INFO L129 PetriNetUnfolder]: 1977/3728 cut-off events. [2021-12-06 19:35:28,458 INFO L130 PetriNetUnfolder]: For 3939/4031 co-relation queries the response was YES. [2021-12-06 19:35:28,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 3728 events. 1977/3728 cut-off events. For 3939/4031 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24754 event pairs, 649 based on Foata normal form. 2/3138 useless extension candidates. Maximal degree in co-relation 9508. Up to 1083 conditions per place. [2021-12-06 19:35:28,488 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 98 selfloop transitions, 15 changer transitions 6/187 dead transitions. [2021-12-06 19:35:28,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 187 transitions, 870 flow [2021-12-06 19:35:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:35:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:35:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2021-12-06 19:35:28,491 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7229007633587786 [2021-12-06 19:35:28,491 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 947 transitions. [2021-12-06 19:35:28,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 947 transitions. [2021-12-06 19:35:28,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:28,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 947 transitions. [2021-12-06 19:35:28,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:28,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:28,497 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:28,497 INFO L186 Difference]: Start difference. First operand has 130 places, 117 transitions, 357 flow. Second operand 10 states and 947 transitions. [2021-12-06 19:35:28,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 187 transitions, 870 flow [2021-12-06 19:35:28,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 187 transitions, 854 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-06 19:35:28,505 INFO L242 Difference]: Finished difference. Result has 135 places, 121 transitions, 403 flow [2021-12-06 19:35:28,505 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=403, PETRI_PLACES=135, PETRI_TRANSITIONS=121} [2021-12-06 19:35:28,505 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2021-12-06 19:35:28,506 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 121 transitions, 403 flow [2021-12-06 19:35:28,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:28,506 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:28,506 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:28,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 19:35:28,506 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:28,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash 158599598, now seen corresponding path program 2 times [2021-12-06 19:35:28,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:28,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263328513] [2021-12-06 19:35:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:28,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:28,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:28,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263328513] [2021-12-06 19:35:28,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263328513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:28,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:35:28,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:35:28,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950583600] [2021-12-06 19:35:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:28,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:35:28,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:28,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:35:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:35:28,629 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-06 19:35:28,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 121 transitions, 403 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:28,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:28,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-06 19:35:28,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:29,241 INFO L129 PetriNetUnfolder]: 2339/4309 cut-off events. [2021-12-06 19:35:29,241 INFO L130 PetriNetUnfolder]: For 5757/5798 co-relation queries the response was YES. [2021-12-06 19:35:29,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11975 conditions, 4309 events. 2339/4309 cut-off events. For 5757/5798 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28423 event pairs, 551 based on Foata normal form. 5/3832 useless extension candidates. Maximal degree in co-relation 11961. Up to 1307 conditions per place. [2021-12-06 19:35:29,278 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 102 selfloop transitions, 19 changer transitions 6/195 dead transitions. [2021-12-06 19:35:29,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 195 transitions, 980 flow [2021-12-06 19:35:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:35:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:35:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2021-12-06 19:35:29,282 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7251908396946565 [2021-12-06 19:35:29,282 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 950 transitions. [2021-12-06 19:35:29,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 950 transitions. [2021-12-06 19:35:29,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:29,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 950 transitions. [2021-12-06 19:35:29,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:29,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:29,288 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:29,288 INFO L186 Difference]: Start difference. First operand has 135 places, 121 transitions, 403 flow. Second operand 10 states and 950 transitions. [2021-12-06 19:35:29,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 195 transitions, 980 flow [2021-12-06 19:35:29,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 195 transitions, 959 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-06 19:35:29,297 INFO L242 Difference]: Finished difference. Result has 140 places, 128 transitions, 490 flow [2021-12-06 19:35:29,298 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=490, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2021-12-06 19:35:29,298 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2021-12-06 19:35:29,298 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 490 flow [2021-12-06 19:35:29,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:29,299 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:29,299 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:29,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 19:35:29,299 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:29,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:29,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1067075906, now seen corresponding path program 3 times [2021-12-06 19:35:29,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:29,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130661013] [2021-12-06 19:35:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:29,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:29,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:29,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130661013] [2021-12-06 19:35:29,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130661013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:29,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:35:29,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:35:29,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138973501] [2021-12-06 19:35:29,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:29,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:35:29,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:29,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:35:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:35:29,418 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-06 19:35:29,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 490 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:29,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:29,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-06 19:35:29,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:29,893 INFO L129 PetriNetUnfolder]: 2280/4136 cut-off events. [2021-12-06 19:35:29,893 INFO L130 PetriNetUnfolder]: For 7452/7576 co-relation queries the response was YES. [2021-12-06 19:35:29,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12574 conditions, 4136 events. 2280/4136 cut-off events. For 7452/7576 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 26533 event pairs, 1099 based on Foata normal form. 14/3705 useless extension candidates. Maximal degree in co-relation 12558. Up to 1831 conditions per place. [2021-12-06 19:35:29,934 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 83 selfloop transitions, 14 changer transitions 10/175 dead transitions. [2021-12-06 19:35:29,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 913 flow [2021-12-06 19:35:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 19:35:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-06 19:35:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 759 transitions. [2021-12-06 19:35:29,936 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7242366412213741 [2021-12-06 19:35:29,936 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 759 transitions. [2021-12-06 19:35:29,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 759 transitions. [2021-12-06 19:35:29,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:29,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 759 transitions. [2021-12-06 19:35:29,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:29,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:29,940 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:29,941 INFO L186 Difference]: Start difference. First operand has 140 places, 128 transitions, 490 flow. Second operand 8 states and 759 transitions. [2021-12-06 19:35:29,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 175 transitions, 913 flow [2021-12-06 19:35:29,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 175 transitions, 899 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-06 19:35:29,950 INFO L242 Difference]: Finished difference. Result has 143 places, 128 transitions, 508 flow [2021-12-06 19:35:29,950 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=508, PETRI_PLACES=143, PETRI_TRANSITIONS=128} [2021-12-06 19:35:29,951 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2021-12-06 19:35:29,951 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 128 transitions, 508 flow [2021-12-06 19:35:29,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:29,951 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:29,951 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:29,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 19:35:29,951 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash 616937690, now seen corresponding path program 4 times [2021-12-06 19:35:29,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580841822] [2021-12-06 19:35:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:29,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:30,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:30,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580841822] [2021-12-06 19:35:30,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580841822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:30,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:35:30,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:35:30,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040386788] [2021-12-06 19:35:30,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:30,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:35:30,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:35:30,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:35:30,062 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-06 19:35:30,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 128 transitions, 508 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:30,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:30,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-06 19:35:30,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:30,772 INFO L129 PetriNetUnfolder]: 3385/6203 cut-off events. [2021-12-06 19:35:30,772 INFO L130 PetriNetUnfolder]: For 13151/13207 co-relation queries the response was YES. [2021-12-06 19:35:30,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19013 conditions, 6203 events. 3385/6203 cut-off events. For 13151/13207 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 43759 event pairs, 917 based on Foata normal form. 25/5649 useless extension candidates. Maximal degree in co-relation 18996. Up to 2198 conditions per place. [2021-12-06 19:35:30,837 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 118 selfloop transitions, 26 changer transitions 1/213 dead transitions. [2021-12-06 19:35:30,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 213 transitions, 1284 flow [2021-12-06 19:35:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:35:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:35:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 945 transitions. [2021-12-06 19:35:30,840 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7213740458015268 [2021-12-06 19:35:30,840 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 945 transitions. [2021-12-06 19:35:30,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 945 transitions. [2021-12-06 19:35:30,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:30,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 945 transitions. [2021-12-06 19:35:30,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.5) internal successors, (945), 10 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:30,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:30,845 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:30,845 INFO L186 Difference]: Start difference. First operand has 143 places, 128 transitions, 508 flow. Second operand 10 states and 945 transitions. [2021-12-06 19:35:30,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 213 transitions, 1284 flow [2021-12-06 19:35:30,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 213 transitions, 1253 flow, removed 4 selfloop flow, removed 6 redundant places. [2021-12-06 19:35:30,856 INFO L242 Difference]: Finished difference. Result has 149 places, 143 transitions, 684 flow [2021-12-06 19:35:30,856 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=684, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2021-12-06 19:35:30,857 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2021-12-06 19:35:30,857 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 684 flow [2021-12-06 19:35:30,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:30,857 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:30,858 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:30,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 19:35:30,858 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:30,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash 721298320, now seen corresponding path program 5 times [2021-12-06 19:35:30,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:30,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615673059] [2021-12-06 19:35:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:30,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:30,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:30,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615673059] [2021-12-06 19:35:30,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615673059] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:35:30,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484725210] [2021-12-06 19:35:30,972 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 19:35:30,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:30,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:35:30,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:35:30,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:35:31,029 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:35:31,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:35:31,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 19:35:31,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:35:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:31,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:35:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:31,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484725210] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 19:35:31,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:35:31,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2021-12-06 19:35:31,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154482503] [2021-12-06 19:35:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:31,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:35:31,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:35:31,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2021-12-06 19:35:31,544 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2021-12-06 19:35:31,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 684 flow. Second operand has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:31,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:31,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2021-12-06 19:35:31,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:32,033 INFO L129 PetriNetUnfolder]: 1279/3099 cut-off events. [2021-12-06 19:35:32,033 INFO L130 PetriNetUnfolder]: For 7636/8046 co-relation queries the response was YES. [2021-12-06 19:35:32,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10184 conditions, 3099 events. 1279/3099 cut-off events. For 7636/8046 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23008 event pairs, 218 based on Foata normal form. 68/2986 useless extension candidates. Maximal degree in co-relation 10165. Up to 966 conditions per place. [2021-12-06 19:35:32,060 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 92 selfloop transitions, 21 changer transitions 7/200 dead transitions. [2021-12-06 19:35:32,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 200 transitions, 1305 flow [2021-12-06 19:35:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:35:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:35:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 993 transitions. [2021-12-06 19:35:32,064 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7580152671755725 [2021-12-06 19:35:32,064 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 993 transitions. [2021-12-06 19:35:32,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 993 transitions. [2021-12-06 19:35:32,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:32,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 993 transitions. [2021-12-06 19:35:32,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.3) internal successors, (993), 10 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:32,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:32,072 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:32,072 INFO L186 Difference]: Start difference. First operand has 149 places, 143 transitions, 684 flow. Second operand 10 states and 993 transitions. [2021-12-06 19:35:32,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 200 transitions, 1305 flow [2021-12-06 19:35:32,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 200 transitions, 1287 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-12-06 19:35:32,086 INFO L242 Difference]: Finished difference. Result has 154 places, 147 transitions, 784 flow [2021-12-06 19:35:32,087 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=784, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2021-12-06 19:35:32,088 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2021-12-06 19:35:32,088 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 784 flow [2021-12-06 19:35:32,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:32,089 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:32,089 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:32,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 19:35:32,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:32,290 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:32,291 INFO L85 PathProgramCache]: Analyzing trace with hash -741365418, now seen corresponding path program 1 times [2021-12-06 19:35:32,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:32,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038750524] [2021-12-06 19:35:32,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:32,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:32,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:32,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038750524] [2021-12-06 19:35:32,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038750524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:35:32,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680883565] [2021-12-06 19:35:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:32,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:32,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:35:32,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:35:32,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:35:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:32,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 19:35:32,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:35:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:32,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:35:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:32,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680883565] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:35:32,747 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:35:32,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2021-12-06 19:35:32,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459474062] [2021-12-06 19:35:32,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:35:32,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 19:35:32,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 19:35:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-06 19:35:32,750 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2021-12-06 19:35:32,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 784 flow. Second operand has 13 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:32,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:32,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2021-12-06 19:35:32,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:34,102 INFO L129 PetriNetUnfolder]: 6226/11076 cut-off events. [2021-12-06 19:35:34,102 INFO L130 PetriNetUnfolder]: For 41315/41315 co-relation queries the response was YES. [2021-12-06 19:35:34,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41208 conditions, 11076 events. 6226/11076 cut-off events. For 41315/41315 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 85950 event pairs, 994 based on Foata normal form. 886/11748 useless extension candidates. Maximal degree in co-relation 41188. Up to 2575 conditions per place. [2021-12-06 19:35:34,174 INFO L132 encePairwiseOnDemand]: 115/131 looper letters, 177 selfloop transitions, 55 changer transitions 21/320 dead transitions. [2021-12-06 19:35:34,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 320 transitions, 2270 flow [2021-12-06 19:35:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 19:35:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-06 19:35:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1787 transitions. [2021-12-06 19:35:34,178 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7179590196866211 [2021-12-06 19:35:34,179 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1787 transitions. [2021-12-06 19:35:34,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1787 transitions. [2021-12-06 19:35:34,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:34,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1787 transitions. [2021-12-06 19:35:34,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 94.05263157894737) internal successors, (1787), 19 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:34,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 131.0) internal successors, (2620), 20 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:34,187 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 131.0) internal successors, (2620), 20 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:34,187 INFO L186 Difference]: Start difference. First operand has 154 places, 147 transitions, 784 flow. Second operand 19 states and 1787 transitions. [2021-12-06 19:35:34,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 320 transitions, 2270 flow [2021-12-06 19:35:34,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 320 transitions, 2233 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-12-06 19:35:34,212 INFO L242 Difference]: Finished difference. Result has 178 places, 171 transitions, 1207 flow [2021-12-06 19:35:34,213 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1207, PETRI_PLACES=178, PETRI_TRANSITIONS=171} [2021-12-06 19:35:34,213 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2021-12-06 19:35:34,213 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 171 transitions, 1207 flow [2021-12-06 19:35:34,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:34,214 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:34,214 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:34,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-06 19:35:34,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-06 19:35:34,415 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:34,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 432141502, now seen corresponding path program 1 times [2021-12-06 19:35:34,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:34,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442934816] [2021-12-06 19:35:34,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:34,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:34,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442934816] [2021-12-06 19:35:34,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442934816] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:35:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758043980] [2021-12-06 19:35:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:34,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:34,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:35:34,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:35:34,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 19:35:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:34,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 19:35:34,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:35:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:35:34,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:35:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:35:35,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758043980] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 19:35:35,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:35:35,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2021-12-06 19:35:35,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608770973] [2021-12-06 19:35:35,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:35,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:35:35,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:35,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:35:35,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-12-06 19:35:35,095 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2021-12-06 19:35:35,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 171 transitions, 1207 flow. Second operand has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:35,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:35,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2021-12-06 19:35:35,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:35,931 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), 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)), 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)), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:35,931 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-06 19:35:35,931 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:35,931 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:35,931 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:35,993 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L52-->L56: Formula: (and (= |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_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|) (= 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), 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)), 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)), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:35,994 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-06 19:35:35,994 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:35,994 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:35,994 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:36,034 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), 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)), 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)), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:36,034 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-06 19:35:36,034 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:36,034 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,034 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,035 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), 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)), 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)), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:36,035 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-06 19:35:36,035 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:36,035 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,035 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,098 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), 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)), 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)), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:36,098 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-06 19:35:36,099 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:36,099 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:36,099 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:36,101 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), 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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:36,101 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-06 19:35:36,101 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:36,101 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:36,102 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:36,173 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), 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)), 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)), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:36,173 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-12-06 19:35:36,173 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,173 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,173 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,175 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), 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)), 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)), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:36,175 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-12-06 19:35:36,175 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,175 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,175 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:36,250 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), 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)), 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)), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:36,251 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-06 19:35:36,251 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-06 19:35:36,251 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:36,251 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:36,575 INFO L129 PetriNetUnfolder]: 5683/11760 cut-off events. [2021-12-06 19:35:36,575 INFO L130 PetriNetUnfolder]: For 88476/89679 co-relation queries the response was YES. [2021-12-06 19:35:36,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53264 conditions, 11760 events. 5683/11760 cut-off events. For 88476/89679 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 105912 event pairs, 969 based on Foata normal form. 258/11125 useless extension candidates. Maximal degree in co-relation 53232. Up to 3992 conditions per place. [2021-12-06 19:35:36,712 INFO L132 encePairwiseOnDemand]: 120/131 looper letters, 200 selfloop transitions, 25 changer transitions 2/308 dead transitions. [2021-12-06 19:35:36,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 308 transitions, 3138 flow [2021-12-06 19:35:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:35:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:35:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 996 transitions. [2021-12-06 19:35:36,715 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7603053435114504 [2021-12-06 19:35:36,715 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 996 transitions. [2021-12-06 19:35:36,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 996 transitions. [2021-12-06 19:35:36,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:36,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 996 transitions. [2021-12-06 19:35:36,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.6) internal successors, (996), 10 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:36,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:36,721 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:36,721 INFO L186 Difference]: Start difference. First operand has 178 places, 171 transitions, 1207 flow. Second operand 10 states and 996 transitions. [2021-12-06 19:35:36,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 308 transitions, 3138 flow [2021-12-06 19:35:36,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 308 transitions, 2847 flow, removed 85 selfloop flow, removed 14 redundant places. [2021-12-06 19:35:36,794 INFO L242 Difference]: Finished difference. Result has 171 places, 182 transitions, 1283 flow [2021-12-06 19:35:36,794 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1283, PETRI_PLACES=171, PETRI_TRANSITIONS=182} [2021-12-06 19:35:36,794 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 54 predicate places. [2021-12-06 19:35:36,794 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 182 transitions, 1283 flow [2021-12-06 19:35:36,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:36,795 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:36,795 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:36,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 19:35:36,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:36,997 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:36,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash -687977584, now seen corresponding path program 2 times [2021-12-06 19:35:36,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:36,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447742423] [2021-12-06 19:35:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:37,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:37,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:37,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447742423] [2021-12-06 19:35:37,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447742423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:35:37,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628674692] [2021-12-06 19:35:37,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:35:37,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:37,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:35:37,162 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:35:37,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 19:35:37,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:35:37,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:35:37,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 19:35:37,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:35:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:37,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:35:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:37,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628674692] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:35:37,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:35:37,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2021-12-06 19:35:37,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336719854] [2021-12-06 19:35:37,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:35:37,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-06 19:35:37,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:37,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-06 19:35:37,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2021-12-06 19:35:37,811 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-06 19:35:37,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 182 transitions, 1283 flow. Second operand has 24 states, 24 states have (on average 87.83333333333333) internal successors, (2108), 24 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:37,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:37,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-06 19:35:37,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:43,737 INFO L129 PetriNetUnfolder]: 26368/50183 cut-off events. [2021-12-06 19:35:43,737 INFO L130 PetriNetUnfolder]: For 298653/298811 co-relation queries the response was YES. [2021-12-06 19:35:44,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211132 conditions, 50183 events. 26368/50183 cut-off events. For 298653/298811 co-relation queries the response was YES. Maximal size of possible extension queue 3044. Compared 521730 event pairs, 3922 based on Foata normal form. 2336/51932 useless extension candidates. Maximal degree in co-relation 211103. Up to 8499 conditions per place. [2021-12-06 19:35:44,327 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 558 selfloop transitions, 95 changer transitions 12/733 dead transitions. [2021-12-06 19:35:44,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 733 transitions, 8145 flow [2021-12-06 19:35:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 19:35:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-12-06 19:35:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2482 transitions. [2021-12-06 19:35:44,330 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7287140340575455 [2021-12-06 19:35:44,330 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2482 transitions. [2021-12-06 19:35:44,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2482 transitions. [2021-12-06 19:35:44,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:44,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2482 transitions. [2021-12-06 19:35:44,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 95.46153846153847) internal successors, (2482), 26 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:44,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 131.0) internal successors, (3537), 27 states have internal predecessors, (3537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:44,339 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 131.0) internal successors, (3537), 27 states have internal predecessors, (3537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:44,339 INFO L186 Difference]: Start difference. First operand has 171 places, 182 transitions, 1283 flow. Second operand 26 states and 2482 transitions. [2021-12-06 19:35:44,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 733 transitions, 8145 flow [2021-12-06 19:35:44,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 733 transitions, 7878 flow, removed 130 selfloop flow, removed 4 redundant places. [2021-12-06 19:35:44,657 INFO L242 Difference]: Finished difference. Result has 208 places, 245 transitions, 2344 flow [2021-12-06 19:35:44,658 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2344, PETRI_PLACES=208, PETRI_TRANSITIONS=245} [2021-12-06 19:35:44,658 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 91 predicate places. [2021-12-06 19:35:44,658 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 245 transitions, 2344 flow [2021-12-06 19:35:44,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 87.83333333333333) internal successors, (2108), 24 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:44,659 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:44,659 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:44,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 19:35:44,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-06 19:35:44,861 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:44,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash 982740406, now seen corresponding path program 3 times [2021-12-06 19:35:44,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:44,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735450891] [2021-12-06 19:35:44,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:44,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:44,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:44,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735450891] [2021-12-06 19:35:44,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735450891] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:35:44,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207601004] [2021-12-06 19:35:44,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 19:35:44,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:44,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:35:44,979 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:35:44,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 19:35:45,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-06 19:35:45,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:35:45,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 19:35:45,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:35:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:35:45,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:35:45,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207601004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:45,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:35:45,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-12-06 19:35:45,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773078958] [2021-12-06 19:35:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:45,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:35:45,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:35:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:35:45,272 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2021-12-06 19:35:45,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 245 transitions, 2344 flow. Second operand has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:45,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:45,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2021-12-06 19:35:45,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:49,013 INFO L129 PetriNetUnfolder]: 10650/26189 cut-off events. [2021-12-06 19:35:49,013 INFO L130 PetriNetUnfolder]: For 313006/316351 co-relation queries the response was YES. [2021-12-06 19:35:49,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136539 conditions, 26189 events. 10650/26189 cut-off events. For 313006/316351 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 304488 event pairs, 3587 based on Foata normal form. 172/25010 useless extension candidates. Maximal degree in co-relation 136494. Up to 11500 conditions per place. [2021-12-06 19:35:49,488 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 156 selfloop transitions, 25 changer transitions 3/270 dead transitions. [2021-12-06 19:35:49,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 270 transitions, 3063 flow [2021-12-06 19:35:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:35:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:35:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2021-12-06 19:35:49,489 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7351145038167939 [2021-12-06 19:35:49,489 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2021-12-06 19:35:49,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2021-12-06 19:35:49,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:49,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2021-12-06 19:35:49,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:49,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:49,493 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:49,493 INFO L186 Difference]: Start difference. First operand has 208 places, 245 transitions, 2344 flow. Second operand 10 states and 963 transitions. [2021-12-06 19:35:49,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 270 transitions, 3063 flow [2021-12-06 19:35:49,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 270 transitions, 2842 flow, removed 84 selfloop flow, removed 9 redundant places. [2021-12-06 19:35:49,814 INFO L242 Difference]: Finished difference. Result has 204 places, 237 transitions, 2103 flow [2021-12-06 19:35:49,814 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2103, PETRI_PLACES=204, PETRI_TRANSITIONS=237} [2021-12-06 19:35:49,815 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 87 predicate places. [2021-12-06 19:35:49,815 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 237 transitions, 2103 flow [2021-12-06 19:35:49,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:49,815 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:49,815 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:49,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 19:35:50,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 19:35:50,017 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash 822271266, now seen corresponding path program 2 times [2021-12-06 19:35:50,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:50,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979026773] [2021-12-06 19:35:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:50,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:35:50,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:50,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979026773] [2021-12-06 19:35:50,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979026773] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:35:50,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:35:50,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:35:50,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943550692] [2021-12-06 19:35:50,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:35:50,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:35:50,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:50,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:35:50,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:35:50,118 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-06 19:35:50,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 237 transitions, 2103 flow. Second operand has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:50,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:50,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-06 19:35:50,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:55,646 INFO L129 PetriNetUnfolder]: 22812/40363 cut-off events. [2021-12-06 19:35:55,646 INFO L130 PetriNetUnfolder]: For 413664/413703 co-relation queries the response was YES. [2021-12-06 19:35:55,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 213869 conditions, 40363 events. 22812/40363 cut-off events. For 413664/413703 co-relation queries the response was YES. Maximal size of possible extension queue 2500. Compared 375455 event pairs, 13066 based on Foata normal form. 43/39806 useless extension candidates. Maximal degree in co-relation 213823. Up to 30527 conditions per place. [2021-12-06 19:35:56,225 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 169 selfloop transitions, 28 changer transitions 15/280 dead transitions. [2021-12-06 19:35:56,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 280 transitions, 3030 flow [2021-12-06 19:35:56,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:35:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 19:35:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 910 transitions. [2021-12-06 19:35:56,228 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6946564885496184 [2021-12-06 19:35:56,228 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 910 transitions. [2021-12-06 19:35:56,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 910 transitions. [2021-12-06 19:35:56,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:35:56,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 910 transitions. [2021-12-06 19:35:56,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:56,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:56,231 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:56,231 INFO L186 Difference]: Start difference. First operand has 204 places, 237 transitions, 2103 flow. Second operand 10 states and 910 transitions. [2021-12-06 19:35:56,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 280 transitions, 3030 flow [2021-12-06 19:35:56,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 280 transitions, 2949 flow, removed 8 selfloop flow, removed 12 redundant places. [2021-12-06 19:35:56,838 INFO L242 Difference]: Finished difference. Result has 200 places, 239 transitions, 2166 flow [2021-12-06 19:35:56,839 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2166, PETRI_PLACES=200, PETRI_TRANSITIONS=239} [2021-12-06 19:35:56,839 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 83 predicate places. [2021-12-06 19:35:56,840 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 239 transitions, 2166 flow [2021-12-06 19:35:56,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:56,840 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:35:56,840 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:35:56,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 19:35:56,841 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:35:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:35:56,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1431070086, now seen corresponding path program 1 times [2021-12-06 19:35:56,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:35:56,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101996692] [2021-12-06 19:35:56,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:56,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:35:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:35:56,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:35:56,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101996692] [2021-12-06 19:35:56,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101996692] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:35:56,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058287962] [2021-12-06 19:35:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:35:56,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:35:56,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:35:56,922 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:35:56,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 19:35:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:35:56,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-06 19:35:56,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:35:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:35:57,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:35:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:35:57,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058287962] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:35:57,324 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:35:57,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2021-12-06 19:35:57,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491321853] [2021-12-06 19:35:57,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:35:57,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:35:57,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:35:57,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:35:57,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:35:57,327 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2021-12-06 19:35:57,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 239 transitions, 2166 flow. Second operand has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:35:57,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:35:57,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2021-12-06 19:35:57,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:35:57,866 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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), 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)), 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)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:57,866 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-06 19:35:57,867 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-06 19:35:57,867 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-06 19:35:57,867 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-06 19:35:57,880 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 1357#(= ~counter~0 1), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:35:57,880 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-06 19:35:57,880 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-06 19:35:57,880 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-06 19:35:57,880 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-06 19:35:58,323 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 35#L52true, 3550#true, 520#(= ~i2~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,324 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-06 19:35:58,324 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-06 19:35:58,324 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-06 19:35:58,324 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-06 19:35:58,327 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 3550#true, 35#L52true, 520#(= ~i2~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,327 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,327 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,327 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,327 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,432 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 520#(= ~i2~0 0)]) [2021-12-06 19:35:58,432 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,432 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,432 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,432 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,492 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, 3179#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,493 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2021-12-06 19:35:58,493 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2021-12-06 19:35:58,493 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2021-12-06 19:35:58,493 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2021-12-06 19:35:58,695 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, 3179#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,695 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-06 19:35:58,695 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:58,695 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,695 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,761 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3179#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,761 INFO L384 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2021-12-06 19:35:58,761 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2021-12-06 19:35:58,761 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2021-12-06 19:35:58,761 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2021-12-06 19:35:58,842 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 35#L52true, 3550#true, 520#(= ~i2~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,842 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-06 19:35:58,842 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,842 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,842 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:58,890 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, 137#true, Black: 1894#(<= 0 ~i1~0), Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), 69#L98-4true, 7#L41true, 1357#(= ~counter~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)), 3550#true, 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,890 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-06 19:35:58,890 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:58,890 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-06 19:35:58,890 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-06 19:35:58,961 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 1894#(<= 0 ~i1~0), 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,961 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-06 19:35:58,961 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:58,961 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-06 19:35:58,961 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-06 19:35:58,961 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 2516#(= ~i1~0 0), 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 7#L41true, 3552#(= ~i1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,961 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-06 19:35:58,961 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-06 19:35:58,961 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-06 19:35:58,962 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:58,999 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3179#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:58,999 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-06 19:35:58,999 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:58,999 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:58,999 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:35:59,013 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,013 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,013 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:59,013 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:59,013 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:35:59,038 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,038 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-06 19:35:59,038 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:59,038 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:59,038 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:59,047 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, 35#L52true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,047 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2021-12-06 19:35:59,047 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:59,048 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:59,048 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:35:59,434 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 111#L64true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,434 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,435 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,435 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,435 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,458 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 1357#(= ~counter~0 1), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,459 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,459 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,459 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,459 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,459 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= ~counter~0 1), 3189#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,459 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,460 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,460 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,460 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,469 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 2516#(= ~i1~0 0), 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 7#L41true, 3552#(= ~i1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,469 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,469 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-06 19:35:59,469 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2021-12-06 19:35:59,469 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,469 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:35:59,470 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 111#L64true, 573#true, 137#true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,471 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,471 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,471 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,471 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,732 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,732 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2021-12-06 19:35:59,732 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2021-12-06 19:35:59,732 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2021-12-06 19:35:59,732 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2021-12-06 19:35:59,732 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,732 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,732 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,732 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,733 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,733 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,826 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:35:59,827 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,827 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,827 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:35:59,827 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,044 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,045 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,045 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,045 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,045 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,045 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,045 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,045 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:36:00,045 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,046 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:36:00,046 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-12-06 19:36:00,221 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, 1357#(= ~counter~0 1), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,221 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-06 19:36:00,221 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:36:00,221 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:36:00,221 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:36:00,349 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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), 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)), 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)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,350 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-12-06 19:36:00,350 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:36:00,350 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2021-12-06 19:36:00,350 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2021-12-06 19:36:00,358 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,358 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2021-12-06 19:36:00,358 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:36:00,358 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2021-12-06 19:36:00,358 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:36:00,544 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,545 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-06 19:36:00,545 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,545 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,545 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,558 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,558 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-06 19:36:00,558 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:36:00,558 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:36:00,558 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-06 19:36:00,558 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L52-->L56: Formula: (and (= |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_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|) (= 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, 7#L41true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,558 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2021-12-06 19:36:00,558 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:36:00,558 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2021-12-06 19:36:00,558 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-06 19:36:00,739 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~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), 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)), 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)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= ~counter~0 1), 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, 555#(= ~j1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,739 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-06 19:36:00,739 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,739 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,739 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:00,839 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 137#true, 107#L99-2true, 1009#(or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,839 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,839 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,839 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,839 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,849 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 137#true, 107#L99-2true, 1009#(or (< ~i1~0 ~N1~0) (<= ~M1~0 ~j1~0)), Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true]) [2021-12-06 19:36:00,850 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,850 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,850 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,850 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,856 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= ~counter~0 1), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,856 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,856 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:36:00,856 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:36:00,856 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:36:00,857 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:00,857 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2021-12-06 19:36:00,857 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:36:00,857 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:36:00,857 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-06 19:36:01,033 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 573#true, 137#true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:01,033 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-06 19:36:01,033 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,033 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,033 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-06 19:36:01,078 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 111#L64true, 3189#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:01,078 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-06 19:36:01,078 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,078 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,078 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,079 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 1357#(= ~counter~0 1), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~0 ~i1~0))), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:01,079 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-06 19:36:01,079 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,079 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,079 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,079 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,079 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2021-12-06 19:36:01,084 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:36:01,084 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-06 19:36:01,084 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-06 19:36:01,084 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-06 19:36:01,084 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-06 19:36:01,214 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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), 111#L64true, 137#true, Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:01,214 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2021-12-06 19:36:01,214 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-06 19:36:01,214 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-06 19:36:01,214 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-06 19:36:01,295 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:36:01,296 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-12-06 19:36:01,296 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-06 19:36:01,296 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-06 19:36:01,296 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-06 19:36:01,599 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:01,599 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2021-12-06 19:36:01,599 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:36:01,599 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:36:01,599 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:36:01,600 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:01,600 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2021-12-06 19:36:01,600 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-06 19:36:01,600 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-06 19:36:01,600 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-06 19:36:01,810 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:01,810 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2021-12-06 19:36:01,810 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:36:01,810 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-06 19:36:01,810 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-06 19:36:02,110 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 1357#(= ~counter~0 1), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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) (<= ~M1~0 ~j1~0)), Black: 2505#(and (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:36:02,110 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-06 19:36:02,110 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:36:02,110 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:36:02,110 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-06 19:36:02,225 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:36:02,225 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-06 19:36:02,225 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:36:02,225 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:36:02,225 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:36:02,226 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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)), 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)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:02,226 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-06 19:36:02,226 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:36:02,226 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:36:02,226 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2021-12-06 19:36:02,322 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2021-12-06 19:36:02,323 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,323 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,323 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,323 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,323 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2021-12-06 19:36:02,323 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,323 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:36:02,324 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-06 19:36:02,324 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,456 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0)), Black: 3175#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), 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)]) [2021-12-06 19:36:02,456 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-06 19:36:02,456 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,456 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-06 19:36:02,457 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,630 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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), 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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3181#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 ~i1~0)) (<= 0 ~i1~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 (<= 0 ~i1~0) (<= ~j2~0 ~i1~0) (or (< ~j2~0 ~M2~0) (<= ~N1~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)), 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)), 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)]) [2021-12-06 19:36:02,631 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-06 19:36:02,631 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,631 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,631 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-06 19:36:02,857 INFO L129 PetriNetUnfolder]: 13872/37203 cut-off events. [2021-12-06 19:36:02,857 INFO L130 PetriNetUnfolder]: For 536006/543256 co-relation queries the response was YES. [2021-12-06 19:36:03,200 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. [2021-12-06 19:36:03,403 INFO L132 encePairwiseOnDemand]: 123/131 looper letters, 79 selfloop transitions, 147 changer transitions 4/354 dead transitions. [2021-12-06 19:36:03,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 354 transitions, 4045 flow [2021-12-06 19:36:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:36:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 19:36:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2021-12-06 19:36:03,404 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8429661941112323 [2021-12-06 19:36:03,404 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2021-12-06 19:36:03,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2021-12-06 19:36:03,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:36:03,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2021-12-06 19:36:03,405 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) [2021-12-06 19:36:03,406 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) [2021-12-06 19:36:03,406 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) [2021-12-06 19:36:03,406 INFO L186 Difference]: Start difference. First operand has 200 places, 239 transitions, 2166 flow. Second operand 7 states and 773 transitions. [2021-12-06 19:36:03,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 354 transitions, 4045 flow [2021-12-06 19:36:03,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 354 transitions, 3984 flow, removed 5 selfloop flow, removed 9 redundant places. [2021-12-06 19:36:03,974 INFO L242 Difference]: Finished difference. Result has 201 places, 322 transitions, 3950 flow [2021-12-06 19:36:03,974 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} [2021-12-06 19:36:03,974 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 84 predicate places. [2021-12-06 19:36:03,974 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 322 transitions, 3950 flow [2021-12-06 19:36:03,975 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) [2021-12-06 19:36:03,975 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:36:03,975 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] [2021-12-06 19:36:03,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 19:36:04,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 19:36:04,177 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)] === [2021-12-06 19:36:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:36:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -670284878, now seen corresponding path program 2 times [2021-12-06 19:36:04,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:36:04,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118297426] [2021-12-06 19:36:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:36:04,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:36:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:36:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:36:04,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:36:04,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118297426] [2021-12-06 19:36:04,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118297426] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:36:04,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848380470] [2021-12-06 19:36:04,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:36:04,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:36:04,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:36:04,309 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:36:04,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 19:36:04,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:36:04,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:36:04,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 19:36:04,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:36:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:36:04,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:36:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:36:04,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848380470] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:36:04,857 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:36:04,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-06 19:36:04,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603535448] [2021-12-06 19:36:04,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:36:04,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 19:36:04,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:36:04,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 19:36:04,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2021-12-06 19:36:04,860 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2021-12-06 19:36:04,861 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) [2021-12-06 19:36:04,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:36:04,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2021-12-06 19:36:04,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:36:22,218 INFO L129 PetriNetUnfolder]: 60760/110335 cut-off events. [2021-12-06 19:36:22,219 INFO L130 PetriNetUnfolder]: For 1346340/1346441 co-relation queries the response was YES. [2021-12-06 19:36:23,138 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. [2021-12-06 19:36:23,735 INFO L132 encePairwiseOnDemand]: 114/131 looper letters, 956 selfloop transitions, 586 changer transitions 0/1609 dead transitions. [2021-12-06 19:36:23,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1609 transitions, 25483 flow [2021-12-06 19:36:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-12-06 19:36:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-12-06 19:36:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 5429 transitions. [2021-12-06 19:36:23,740 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7145301395103975 [2021-12-06 19:36:23,740 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 5429 transitions. [2021-12-06 19:36:23,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 5429 transitions. [2021-12-06 19:36:23,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:36:23,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 5429 transitions. [2021-12-06 19:36:23,747 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) [2021-12-06 19:36:23,753 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) [2021-12-06 19:36:23,753 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) [2021-12-06 19:36:23,753 INFO L186 Difference]: Start difference. First operand has 201 places, 322 transitions, 3950 flow. Second operand 58 states and 5429 transitions. [2021-12-06 19:36:23,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1609 transitions, 25483 flow [2021-12-06 19:36:29,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 1609 transitions, 23237 flow, removed 1105 selfloop flow, removed 3 redundant places. [2021-12-06 19:36:29,610 INFO L242 Difference]: Finished difference. Result has 290 places, 751 transitions, 11492 flow [2021-12-06 19:36:29,610 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} [2021-12-06 19:36:29,611 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 173 predicate places. [2021-12-06 19:36:29,611 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 751 transitions, 11492 flow [2021-12-06 19:36:29,611 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) [2021-12-06 19:36:29,611 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:36:29,611 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] [2021-12-06 19:36:29,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-06 19:36:29,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-06 19:36:29,813 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)] === [2021-12-06 19:36:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:36:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1537742894, now seen corresponding path program 3 times [2021-12-06 19:36:29,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:36:29,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926604218] [2021-12-06 19:36:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:36:29,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:36:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:36:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:36:29,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:36:29,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926604218] [2021-12-06 19:36:29,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926604218] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:36:29,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740806223] [2021-12-06 19:36:29,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 19:36:29,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:36:29,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:36:29,953 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:36:29,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 19:36:30,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-06 19:36:30,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:36:30,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 19:36:30,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:36:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:36:30,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:36:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:36:30,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740806223] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:36:30,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:36:30,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2021-12-06 19:36:30,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280136110] [2021-12-06 19:36:30,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:36:30,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-06 19:36:30,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:36:30,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-06 19:36:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-12-06 19:36:30,558 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-06 19:36:30,559 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) [2021-12-06 19:36:30,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:36:30,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-06 19:36:30,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:37:12,848 INFO L129 PetriNetUnfolder]: 97298/182625 cut-off events. [2021-12-06 19:37:12,848 INFO L130 PetriNetUnfolder]: For 6436872/6436969 co-relation queries the response was YES. [2021-12-06 19:37:15,486 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. [2021-12-06 19:37:16,797 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 1416 selfloop transitions, 590 changer transitions 98/2172 dead transitions. [2021-12-06 19:37:16,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 2172 transitions, 39798 flow [2021-12-06 19:37:16,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 19:37:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-12-06 19:37:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2175 transitions. [2021-12-06 19:37:16,800 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7218718884832392 [2021-12-06 19:37:16,800 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2175 transitions. [2021-12-06 19:37:16,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2175 transitions. [2021-12-06 19:37:16,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:37:16,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2175 transitions. [2021-12-06 19:37:16,803 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) [2021-12-06 19:37:16,805 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) [2021-12-06 19:37:16,806 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) [2021-12-06 19:37:16,806 INFO L186 Difference]: Start difference. First operand has 290 places, 751 transitions, 11492 flow. Second operand 23 states and 2175 transitions. [2021-12-06 19:37:16,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 2172 transitions, 39798 flow [2021-12-06 19:38:23,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 2172 transitions, 37003 flow, removed 1121 selfloop flow, removed 16 redundant places. [2021-12-06 19:38:23,982 INFO L242 Difference]: Finished difference. Result has 307 places, 1213 transitions, 20047 flow [2021-12-06 19:38:23,983 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} [2021-12-06 19:38:23,984 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 190 predicate places. [2021-12-06 19:38:23,984 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 1213 transitions, 20047 flow [2021-12-06 19:38:23,985 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) [2021-12-06 19:38:23,985 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:38:23,985 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] [2021-12-06 19:38:24,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 19:38:24,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 19:38:24,187 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)] === [2021-12-06 19:38:24,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:38:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash 160369916, now seen corresponding path program 4 times [2021-12-06 19:38:24,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:38:24,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49638806] [2021-12-06 19:38:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:38:24,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:38:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:38:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:38:24,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:38:24,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49638806] [2021-12-06 19:38:24,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49638806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:38:24,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032597743] [2021-12-06 19:38:24,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 19:38:24,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:38:24,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:38:24,337 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:38:24,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 19:38:24,396 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 19:38:24,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:38:24,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 19:38:24,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:38:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:38:24,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:38:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:38:24,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032597743] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:38:24,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:38:24,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-06 19:38:24,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430779340] [2021-12-06 19:38:24,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:38:24,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 19:38:24,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:38:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 19:38:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-12-06 19:38:24,883 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2021-12-06 19:38:24,884 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) [2021-12-06 19:38:24,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:38:24,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2021-12-06 19:38:24,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 19:40:07,116 INFO L129 PetriNetUnfolder]: 174098/336389 cut-off events. [2021-12-06 19:40:07,116 INFO L130 PetriNetUnfolder]: For 12775559/12775810 co-relation queries the response was YES. [2021-12-06 19:40:12,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2587577 conditions, 336389 events. 174098/336389 cut-off events. For 12775559/12775810 co-relation queries the response was YES. Maximal size of possible extension queue 21584. Compared 4458830 event pairs, 19683 based on Foata normal form. 5294/338101 useless extension candidates. Maximal degree in co-relation 2587484. Up to 60912 conditions per place. [2021-12-06 19:40:15,246 INFO L132 encePairwiseOnDemand]: 114/131 looper letters, 2497 selfloop transitions, 2527 changer transitions 103/5194 dead transitions. [2021-12-06 19:40:15,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 5194 transitions, 102637 flow [2021-12-06 19:40:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-12-06 19:40:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2021-12-06 19:40:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 7179 transitions. [2021-12-06 19:40:15,252 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7117081391890552 [2021-12-06 19:40:15,252 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 7179 transitions. [2021-12-06 19:40:15,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 7179 transitions. [2021-12-06 19:40:15,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 19:40:15,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 7179 transitions. [2021-12-06 19:40:15,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 78 states, 77 states have (on average 93.23376623376623) internal successors, (7179), 77 states have internal predecessors, (7179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:40:15,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 78 states, 78 states have (on average 131.0) internal successors, (10218), 78 states have internal predecessors, (10218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:40:15,271 INFO L81 ComplementDD]: Finished complementDD. Result has 78 states, 78 states have (on average 131.0) internal successors, (10218), 78 states have internal predecessors, (10218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:40:15,271 INFO L186 Difference]: Start difference. First operand has 307 places, 1213 transitions, 20047 flow. Second operand 77 states and 7179 transitions. [2021-12-06 19:40:15,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 5194 transitions, 102637 flow [2021-12-06 19:46:41,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 5194 transitions, 99490 flow, removed 1365 selfloop flow, removed 9 redundant places. [2021-12-06 19:46:41,119 INFO L242 Difference]: Finished difference. Result has 420 places, 3381 transitions, 73549 flow [2021-12-06 19:46:41,119 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=19470, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=637, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=77, PETRI_FLOW=73549, PETRI_PLACES=420, PETRI_TRANSITIONS=3381} [2021-12-06 19:46:41,120 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 303 predicate places. [2021-12-06 19:46:41,120 INFO L470 AbstractCegarLoop]: Abstraction has has 420 places, 3381 transitions, 73549 flow [2021-12-06 19:46:41,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2021-12-06 19:46:41,121 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 19:46:41,121 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] [2021-12-06 19:46:41,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-06 19:46:41,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 19:46:41,322 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-06 19:46:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:46:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash 608892172, now seen corresponding path program 5 times [2021-12-06 19:46:41,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:46:41,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851500951] [2021-12-06 19:46:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:46:41,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:46:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:46:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:46:41,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:46:41,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851500951] [2021-12-06 19:46:41,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851500951] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:46:41,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228107104] [2021-12-06 19:46:41,465 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 19:46:41,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:46:41,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:46:41,466 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:46:41,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ffd679d-e3ff-4388-86c4-a547b2d25163/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 19:46:41,530 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-06 19:46:41,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:46:41,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 19:46:41,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:46:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:46:41,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:46:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:46:42,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228107104] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:46:42,009 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:46:42,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2021-12-06 19:46:42,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401230939] [2021-12-06 19:46:42,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:46:42,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-06 19:46:42,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:46:42,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-06 19:46:42,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2021-12-06 19:46:42,012 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2021-12-06 19:46:42,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 3381 transitions, 73549 flow. Second operand has 24 states, 24 states have (on average 87.83333333333333) internal successors, (2108), 24 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:46:42,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 19:46:42,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2021-12-06 19:46:42,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand